Instructions and logic to provide simd sm3 cryptographic hashing functionality

ABSTRACT

Instructions and logic provide SIMD SM3 cryptographic hashing functionality. Some embodiments include a processor comprising: a decoder to decode instructions for a SIMD SM3 message expansion, specifying first and second source data operand sets, and an expansion extent. Processor execution units, responsive to the instruction, perform a number of SM3 message expansions, from the first and second source data operand sets, determined by the specified expansion extent and store the result into a SIMD destination register. Some embodiments also execute instructions for a SIMD SM3 hash round-slice portion of the hashing algorithm, from an intermediate hash value input, a source data set, and a round constant set. Processor execution units perform a set of SM3 hashing round iterations upon the source data set, applying the intermediate hash value input and the round constant set, and store a new hash value result in a SIMD destination register.

FIELD OF THE DISCLOSURE

The present disclosure pertains to the field of processing logic,microprocessors, and associated instruction set architecture that, whenexecuted by the processor or other processing logic, perform logical,mathematical, or other functional operations. In particular, thedisclosure relates to instructions and logic to provide SIMD SM3cryptographic hashing functionality.

BACKGROUND OF THE DISCLOSURE

A cryptographic hash function is a hash function, i.e. an algorithm thattakes an arbitrary block of data and returns a fixed-size bit string,the (cryptographic) hash value, such that an (accidental or intentional)change to the data will (with very high probability) change the hashvalue. The data to be encoded are often called the “message,” and thehash value is sometimes called the message digest or “digest.”

Cryptographic hash functions have many information securityapplications, notably in digital signatures, message authenticationcodes (MACs), and other forms of authentication. They can also be usedas ordinary hash functions, to index data in hash tables, forfingerprinting, to detect duplicate data or uniquely identify files, andas checksums to detect accidental data corruption. In informationsecurity contexts, cryptographic hash values are sometimes called(digital) fingerprints, checksums, or just hash values, even though allthese terms stand for functions with rather different properties andpurposes.

Two major tradeoffs in cryptographic hash function design, as visible toa programmer, are: (1) complexity of calculation—too simple and the hashis easily broken, too complex and the hash takes too long to calculate;and (2) size of output—too small and brute-force attacks are too easy,too big and the cost of storing and sending the hash value is too large.One of the most famous cryptographic hash functions is the MD5(Message-Digest algorithm 5) algorithm developed by Ronald Rivest. Othercommon algorithms are SHA-1 (Secure Hash Algorithm 1) as well asvariants SHA-2 and SHA-3 published by the National Institute ofStandards and Technology (NIST) as a U.S. Federal Information ProcessingStandard (FIPS). Another cryptographic hash algorithm of interest, whichwas invented by Xiaoyun Wang et al., is the SM3 cryptographic hashfunction—published by the Chinese Commercial Cryptography AdministrationOffice and submitted as an Internet-Draft to the Internet EngineeringTask Force (IETF) for the use of electronic authentication servicesystem.

Commonly, hardware acceleration for hash algorithms is not required,because they are not designed to be especially computationallydemanding. But one special purpose dynamic password enciphering chip isproduced by Shenzhen Tongfang Electronic Equipment Co., Ltd. of China,which implements the SM3 cryptographic hash algorithm in hardware.

Typical straightforward hardware implementations using lookup memories,truth tables, binary decision diagrams or field-programmable gate arrays(FPGAs) are costly in terms of circuit area. Alternative approachesusing finite fields isomorphic to GF(256) may be efficient in area butmay also be slower than the straightforward hardware implementations.

One drawback to a complete hardware approach is that it is not easilyfit into a standard execution pipeline of a modern microprocessorwithout making special considerations for such things as the handling ofinterrupts specially, or the concurrent superscalar execution of otherinstructions. Another mismatch with standard execution pipelines is thelatency required for executing an entire hashing algorithm.

Modern processors often include instructions to provide operations thatare computationally intensive, but offer a high level of dataparallelism that can be exploited through an efficient implementationusing various data storage devices, such as for example, singleinstruction multiple data (SIMD) vector registers. The centralprocessing unit (CPU) may then provide parallel hardware to supportprocessing vectors. A vector is a data structure that holds a number ofconsecutive data elements. A vector register of size M may contain Nvector elements of size 0, where N=M/O. For instance, a 64-byte vectorregister may be partitioned into (a) 64 vector elements, with eachelement holding a data item that occupies 1 byte, (b) 32 vector elementsto hold data items that occupy 2 bytes (or one “word”) each, (c) 16vector elements to hold data items that occupy 4 bytes (or one“doubleword”) each, or (d) 8 vector elements to hold data items thatoccupy 8 bytes (or one “quadword”) each. The nature of the parallelismin SIMD vector registers could be well suited for the handling of securehashing algorithms.

To date, potential solutions to such complexities, mismatches,performance limiting issues, and other bottlenecks have not beenadequately explored.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example and notlimitation in the figures of the accompanying drawings.

FIG. 1A is a block diagram of one embodiment of a system that executesinstructions to provide SIMD SM3 cryptographic hashing functionality.

FIG. 1B is a block diagram of another embodiment of a system thatexecutes instructions to provide functionality.

FIG. 1C is a block diagram of another embodiment of a system thatexecutes instructions to provide SIMD SM3 cryptographic hashingfunctionality.

FIG. 2 is a block diagram of one embodiment of a processor that executesinstructions to provide SIMD SM3 cryptographic hashing functionality.

FIG. 3A illustrates packed data types according to one embodiment.

FIG. 3B illustrates packed data types according to one embodiment.

FIG. 3C illustrates packed data types according to one embodiment.

FIG. 3D illustrates an instruction encoding to provide SIMD SM3cryptographic hashing functionality according to one embodiment.

FIG. 3E illustrates an instruction encoding to provide SIMD SM3cryptographic hashing functionality according to another embodiment.

FIG. 3F illustrates an instruction encoding to provide SIMD SM3cryptographic hashing functionality according to another embodiment.

FIG. 3G illustrates an instruction encoding to provide SIMD SM3cryptographic hashing functionality according to another embodiment.

FIG. 3H illustrates an instruction encoding to provide SIMD SM3cryptographic hashing functionality according to another embodiment.

FIG. 4A illustrates elements of one embodiment of a processormicro-architecture to execute instructions that provide SIMD SM3cryptographic hashing functionality.

FIG. 4B illustrates elements of another embodiment of a processormicro-architecture to execute instructions that provide SIMD SM3cryptographic hashing functionality.

FIG. 5 is a block diagram of one embodiment of a processor to executeinstructions that provide SIMD SM3 cryptographic hashing functionality.

FIG. 6 is a block diagram of one embodiment of a computer system toexecute instructions that provide SIMD SM3 cryptographic hashingfunctionality.

FIG. 7 is a block diagram of another embodiment of a computer system toexecute instructions that provide SIMD SM3 cryptographic hashingfunctionality.

FIG. 8 is a block diagram of another embodiment of a computer system toexecute instructions that provide SIMD SM3 cryptographic hashingfunctionality.

FIG. 9 is a block diagram of one embodiment of a system-on-a-chip toexecute instructions that provide SIMD SM3 cryptographic hashingfunctionality.

FIG. 10 is a block diagram of an embodiment of a processor to executeinstructions that provide SIMD SM3 cryptographic hashing functionality.

FIG. 11 is a block diagram of one embodiment of an IP core developmentsystem that provides SIMD SM3 cryptographic hashing functionality.

FIG. 12 illustrates one embodiment of an architecture emulation systemthat provides SIMD SM3 cryptographic hashing functionality.

FIG. 13 illustrates one embodiment of a system to translate instructionsthat provide SIMD SM3 cryptographic hashing functionality.

FIG. 14A illustrates a diagram for one embodiment of an apparatus forexecution of an instruction to provide SIMD SM3 cryptographic hashingfunctionality.

FIG. 14B illustrates a diagram for an alternative embodiment of anapparatus for execution of an instruction to provide SIMD SM3cryptographic hashing functionality.

FIG. 15 illustrates a diagram for another alternative embodiment of anapparatus for execution of an instruction to provide SIMD SM3cryptographic hashing functionality.

FIG. 16 illustrates a diagram for another alternative embodiment of anapparatus for execution of an instruction to provide SIMD SM3cryptographic hashing functionality.

FIG. 17A illustrates a diagram for one embodiment of an apparatus forexecution of another instruction to provide SIMD SM3 cryptographichashing functionality.

FIG. 17B illustrates a diagram for an alternative embodiment of anapparatus for execution of another instruction to provide SIMD SM3cryptographic hashing functionality.

FIG. 18A illustrates a diagram for another alternative embodiment of anapparatus for execution of another instruction to provide SIMD SM3cryptographic hashing functionality.

FIG. 18B illustrates a diagram for yet another alternative embodiment ofan apparatus for execution of another instruction to provide SIMD SM3cryptographic hashing functionality.

FIG. 19 illustrates a flow diagram for an embodiment of a process forexecution of an instruction to provide SIMD SM3 cryptographic hashingfunctionality.

FIG. 20 illustrates a flow diagram for another embodiment of a processfor execution of an instruction to provide SIMD SM3 cryptographichashing functionality.

FIG. 21 illustrates a flow diagram for an embodiment of a process forexecution of an alternative instruction to provide SIMD SM3cryptographic hashing functionality.

DETAILED DESCRIPTION

The following description discloses instructions and processing logic toprovide SIMD SM3 cryptographic hashing functionality within or inassociation with a processor, computer system, or other processingapparatus. Some embodiments include a processor comprising a decoder todecode instructions for a SIMD SM3 message expansion, specifying firstand second source data operand sets, and an expansion extent. Processorexecution units, responsive to the instruction, perform a number of SM3message expansions, from the first and second source data operand sets,determined by the specified expansion extent and store the result into aSIMD destination register. Some embodiments also execute instructionsfor a SIMD SM3 hash round-slice portion of the hashing algorithm, froman intermediate hash value input, a source data set, and a roundconstant set. Processor execution units perform a set of SM3 hashinground iterations upon the source data set, applying the intermediatehash value input and the round constant set, and store a new hash valueresult in a SIMD destination register. Details of the SM3 cryptographichash algorithm may be found in “SM3 Hash Function,” IETF Internet-Draft,Chinese Academy of Science, 14 Feb. 2014, version 01, available on theworld-wide-web at tools.ietf.org/pdf/draft-shen-sm3-hash-01.pdf.

It will be appreciated that SIMD SM3 cryptographic hashing instructionsmay be used to provide SIMD SM3 cryptographic hashing functionality inapplications, such as cryptographic protocols and Internet communicationto assure data integrity, digital signatures, identity verification,message content authentication and message origin authentication forfinancial transactions, electronic commerce, electronic mail, softwaredistribution, data storage, random number generation, etc.

For some embodiments of SIMD instructions and processing logic toprovide SM3 cryptographic hashing functionality, SM3 message expansionand SM3 cryptographic hash rounds may be performed in slices ofiterations concurrently and/or in parallel in a standard executionpipeline of a modern microprocessor. It will be appreciated that thenumber of iterations per slice may be conveniently chosen so as toprovide a sufficient cover for other concurrent in-flight instructionsby the latencies associated with performing a slice of SM3 messageexpansions and/or a slice of SM3 cryptographic hash rounds. Thus it willalso be appreciated that providing execution of an instruction for aSIMD SM3 cryptographic hashing algorithm round slice, which has a numberof iterations (e.g. two, four or eight iterations per slice) but lessthat the total number of round iterations of the hash algorithm, permitsconcurrent execution of such other required instructions (e.g. SM3message expansion instructions) in a superscalar execution pipeline,and/or in an out-of-order processor pipeline, thereby significantlyimproving processing throughput for a large number of applications, andleveraging the scaling of frequencies for fabrication processimprovements associated with general purpose processors.

In the following description, numerous specific details such asprocessing logic, processor types, micro-architectural conditions,events, enablement mechanisms, and the like are set forth in order toprovide a more thorough understanding of embodiments of the presentinvention. It will be appreciated, however, by one skilled in the artthat the invention may be practiced without such specific details.Additionally, some well known structures, circuits, and the like havenot been shown in detail to avoid unnecessarily obscuring embodiments ofthe present invention.

Although the following embodiments are described with reference to aprocessor, other embodiments are applicable to other types of integratedcircuits and logic devices. Similar techniques and teachings ofembodiments of the present invention can be applied to other types ofcircuits or semiconductor devices that can benefit from higher pipelinethroughput and improved performance. The teachings of embodiments of thepresent invention are applicable to any processor or machine thatperforms data manipulations. However, the present invention is notlimited to processors or machines that perform 512 bit, 256 bit, 128bit, 64 bit, 32 bit, or 16 bit data operations and can be applied to anyprocessor and machine in which manipulation or management of data isperformed. In addition, the following description provides examples, andthe accompanying drawings show various examples for the purposes ofillustration. However, these examples should not be construed in alimiting sense as they are merely intended to provide examples ofembodiments of the present invention rather than to provide anexhaustive list of all possible implementations of embodiments of thepresent invention.

Although the below examples describe instruction handling anddistribution in the context of execution units and logic circuits, otherembodiments of the present invention can be accomplished by way of dataand/or instructions stored on a machine-readable, tangible medium, whichwhen performed by a machine cause the machine to perform functionsconsistent with at least one embodiment of the invention. In oneembodiment, functions associated with embodiments of the presentinvention are embodied in machine-executable instructions. Theinstructions can be used to cause a general-purpose or special-purposeprocessor that is programmed with the instructions to perform the stepsof the present invention. Embodiments of the present invention may beprovided as a computer program product or software which may include amachine or computer-readable medium having stored thereon instructionswhich may be used to program a computer (or other electronic devices) toperform one or more operations according to embodiments of the presentinvention. Alternatively, steps of embodiments of the present inventionmight be performed by specific hardware components that containfixed-function logic for performing the steps, or by any combination ofprogrammed computer components and fixed-function hardware components.

Instructions used to program logic to perform embodiments of theinvention can be stored within a memory in the system, such as DRAM,cache, flash memory, or other storage. Furthermore, the instructions canbe distributed via a network or by way of other computer readable media.Thus a machine-readable medium may include any mechanism for storing ortransmitting information in a form readable by a machine (e.g., acomputer), but is not limited to, floppy diskettes, optical disks,Compact Disc, Read-Only Memory (CD-ROMs), and magneto-optical disks,Read-Only Memory (ROMs), Random Access Memory (RAM), ErasableProgrammable Read-Only Memory (EPROM), Electrically ErasableProgrammable Read-Only Memory (EEPROM), magnetic or optical cards, flashmemory, or a tangible, machine-readable storage used in the transmissionof information over the Internet via electrical, optical, acoustical orother forms of propagated signals (e.g., carrier waves, infraredsignals, digital signals, etc.). Accordingly, the computer-readablemedium includes any type of tangible machine-readable medium suitablefor storing or transmitting electronic instructions or information in aform readable by a machine (e.g., a computer).

A design may go through various stages, from creation to simulation tofabrication. Data representing a design may represent the design in anumber of manners. First, as is useful in simulations, the hardware maybe represented using a hardware description language or anotherfunctional description language. Additionally, a circuit level modelwith logic and/or transistor gates may be produced at some stages of thedesign process. Furthermore, most designs, at some stage, reach a levelof data representing the physical placement of various devices in thehardware model. In the case where conventional semiconductor fabricationtechniques are used, the data representing the hardware model may be thedata specifying the presence or absence of various features on differentmask layers for masks used to produce the integrated circuit. In anyrepresentation of the design, the data may be stored in any form of amachine readable medium. A memory or a magnetic or optical storage suchas a disc may be the machine readable medium to store informationtransmitted via optical or electrical wave modulated or otherwisegenerated to transmit such information. When an electrical carrier waveindicating or carrying the code or design is transmitted, to the extentthat copying, buffering, or re-transmission of the electrical signal isperformed, a new copy is made. Thus, a communication provider or anetwork provider may store on a tangible, machine-readable medium, atleast temporarily, an article, such as information encoded into acarrier wave, embodying techniques of embodiments of the presentinvention.

In modern processors, a number of different execution units are used toprocess and execute a variety of code and instructions. Not allinstructions are created equal as some are quicker to complete whileothers can take a number of clock cycles to complete. The faster thethroughput of instructions, the better the overall performance of theprocessor. Thus it would be advantageous to have as many instructionsexecute as fast as possible. However, there are certain instructionsthat have greater complexity and require more in terms of execution timeand processor resources. For example, there are floating pointinstructions, load/store operations, data moves, etc.

As more computer systems are used in internet, text, and multimediaapplications, additional processor support has been introduced overtime. In one embodiment, an instruction set may be associated with oneor more computer architectures, including data types, instructions,register architecture, addressing modes, memory architecture, interruptand exception handling, and external input and output (I/O).

In one embodiment, the instruction set architecture (ISA) may beimplemented by one or more micro-architectures, which includes processorlogic and circuits used to implement one or more instruction sets.Accordingly, processors with different micro-architectures can share atleast a portion of a common instruction set. For example, Intel® Pentium4 processors, Intel® Core™ processors, and processors from AdvancedMicro Devices, Inc. of Sunnyvale Calif. implement nearly identicalversions of the x86 instruction set (with some extensions that have beenadded with newer versions), but have different internal designs.Similarly, processors designed by other processor development companies,such as ARM Holdings, Ltd., MIPS, or their licensees or adopters, mayshare at least a portion a common instruction set, but may includedifferent processor designs. For example, the same register architectureof the ISA may be implemented in different ways in differentmicro-architectures using new or well-known techniques, includingdedicated physical registers, one or more dynamically allocated physicalregisters using a register renaming mechanism (e.g., the use of aRegister Alias Table (RAT), a Reorder Buffer (ROB) and a retirementregister file. In one embodiment, registers may include one or moreregisters, register architectures, register files, or other registersets that may or may not be addressable by a software programmer.

In one embodiment, an instruction may include one or more instructionformats. In one embodiment, an instruction format may indicate variousfields (number of bits, location of bits, etc.) to specify, among otherthings, the operation to be performed and the operand(s) on which thatoperation is to be performed. Some instruction formats may be furtherbroken defined by instruction templates (or sub formats). For example,the instruction templates of a given instruction format may be definedto have different subsets of the instruction format's fields and/ordefined to have a given field interpreted differently. In oneembodiment, an instruction is expressed using an instruction format(and, if defined, in a given one of the instruction templates of thatinstruction format) and specifies or indicates the operation and theoperands upon which the operation will operate.

Scientific, financial, auto-vectorized general purpose, RMS(recognition, mining, and synthesis), and visual and multimediaapplications (e.g., 2D/3D graphics, image processing, videocompression/decompression, voice recognition algorithms and audiomanipulation) may require the same operation to be performed on a largenumber of data items. In one embodiment, Single Instruction MultipleData (SIMD) refers to a type of instruction that causes a processor toperform an operation on multiple data elements. SIMD technology may beused in processors that can logically divide the bits in a register intoa number of fixed-sized or variable-sized data elements, each of whichrepresents a separate value. For example, in one embodiment, the bits ina 64-bit register may be organized as a source operand containing fourseparate 16-bit data elements, each of which represents a separate16-bit value. This type of data may be referred to as ‘packed’ data typeor ‘vector’ data type, and operands of this data type are referred to aspacked data operands or vector operands. In one embodiment, a packeddata item or vector may be a sequence of packed data elements storedwithin a single register, and a packed data operand or a vector operandmay a source or destination operand of a SIMD instruction (or ‘packeddata instruction’ or a ‘vector instruction’). In one embodiment, a SIMDinstruction specifies a single vector operation to be performed on twosource vector operands to generate a destination vector operand (alsoreferred to as a result vector operand) of the same or different size,with the same or different number of data elements, and in the same ordifferent data element order.

SIMD technology, such as that employed by the Intel® Core™ processorshaving an instruction set including x86, MMX™, Streaming SIMD Extensions(SSE), SSE2, SSE3, SSE4.1, and SSE4.2 instructions, ARM processors, suchas the ARM Cortex® family of processors having an instruction setincluding the Vector Floating Point (VFP) and/or NEON instructions, andMIPS processors, such as the Loongson family of processors developed bythe Institute of Computing Technology (ICT) of the Chinese Academy ofSciences, has enabled a significant improvement in applicationperformance (Core™ and MMX™ are registered trademarks or trademarks ofIntel Corporation of Santa Clara, Calif.).

In one embodiment, destination and source registers/data are genericterms to represent the source and destination of the corresponding dataor operation. In some embodiments, they may be implemented by registers,memory, or other storage areas having other names or functions thanthose depicted. For example, in one embodiment, “DEST1” may be atemporary storage register or other storage area, whereas “SRC1” and“SRC2” may be a first and second source storage register or otherstorage area, and so forth. In other embodiments, two or more of the SRCand DEST storage areas may correspond to different data storage elementswithin the same storage area (e.g., a SIMD register). In one embodiment,one of the source registers may also act as a destination register by,for example, writing back the result of an operation performed on thefirst and second source data to one of the two source registers servingas a destination registers.

FIG. 1A is a block diagram of an exemplary computer system formed with aprocessor that includes execution units to execute an instruction inaccordance with one embodiment of the present invention. System 100includes a component, such as a processor 102 to employ execution unitsincluding logic to perform algorithms for process data, in accordancewith the present invention, such as in the embodiment described herein.System 100 is representative of processing systems based on the PENTIUM®III, PENTIUM® 4, Xeon™, Itanium®, XScale™ and/or StrongARM™microprocessors available from Intel Corporation of Santa Clara, Calif.,although other systems (including PCs having other microprocessors,engineering workstations, set-top boxes and the like) may also be used.In one embodiment, sample system 100 may execute a version of theWINDOWS™ operating system available from Microsoft Corporation ofRedmond, Wash., although other operating systems (UNIX and Linux forexample), embedded software, and/or graphical user interfaces, may alsobe used. Thus, embodiments of the present invention are not limited toany specific combination of hardware circuitry and software.

Embodiments are not limited to computer systems. Alternative embodimentsof the present invention can be used in other devices such as handhelddevices and embedded applications. Some examples of handheld devicesinclude cellular phones, Internet Protocol devices, digital cameras,personal digital assistants (PDAs), and handheld PCs. Embeddedapplications can include a micro controller, a digital signal processor(DSP), system on a chip, network computers (NetPC), set-top boxes,network hubs, wide area network (WAN) switches, or any other system thatcan perform one or more instructions in accordance with at least oneembodiment.

FIG. 1A is a block diagram of a computer system 100 formed with aprocessor 102 that includes one or more execution units 108 to performan algorithm to perform at least one instruction in accordance with oneembodiment of the present invention. One embodiment may be described inthe context of a single processor desktop or server system, butalternative embodiments can be included in a multiprocessor system.System 100 is an example of a ‘hub’ system architecture. The computersystem 100 includes a processor 102 to process data signals. Theprocessor 102 can be a complex instruction set computer (CISC)microprocessor, a reduced instruction set computing (RISC)microprocessor, a very long instruction word (VLIW) microprocessor, aprocessor implementing a combination of instruction sets, or any otherprocessor device, such as a digital signal processor, for example. Theprocessor 102 is coupled to a processor bus 110 that can transmit datasignals between the processor 102 and other components in the system100. The elements of system 100 perform their conventional functionsthat are well known to those familiar with the art.

In one embodiment, the processor 102 includes a Level 1 (L1) internalcache memory 104. Depending on the architecture, the processor 102 canhave a single internal cache or multiple levels of internal cache.Alternatively, in another embodiment, the cache memory can resideexternal to the processor 102. Other embodiments can also include acombination of both internal and external caches depending on theparticular implementation and needs. Register file 106 can storedifferent types of data in various registers including integerregisters, floating point registers, status registers, and instructionpointer register.

Execution unit 108, including logic to perform integer and floatingpoint operations, also resides in the processor 102. The processor 102also includes a microcode (ucode) ROM that stores microcode for certainmacroinstructions. For one embodiment, execution unit 108 includes logicto handle a packed instruction set 109. By including the packedinstruction set 109 in the instruction set of a general-purposeprocessor 102, along with associated circuitry to execute theinstructions, the operations used by many multimedia applications may beperformed using packed data in a general-purpose processor 102. Thus,many multimedia applications can be accelerated and executed moreefficiently by using the full width of a processor's data bus forperforming operations on packed data. This can eliminate the need totransfer smaller units of data across the processor's data bus toperform one or more operations one data element at a time.

Alternate embodiments of an execution unit 108 can also be used in microcontrollers, embedded processors, graphics devices, DSPs, and othertypes of logic circuits. System 100 includes a memory 120. Memory 120can be a dynamic random access memory (DRAM) device, a static randomaccess memory (SRAM) device, flash memory device, or other memorydevice. Memory 120 can store instructions and/or data represented bydata signals that can be executed by the processor 102.

A system logic chip 116 is coupled to the processor bus 110 and memory120. The system logic chip 116 in the illustrated embodiment is a memorycontroller hub (MCH). The processor 102 can communicate to the MCH 116via a processor bus 110. The MCH 116 provides a high bandwidth memorypath 118 to memory 120 for instruction and data storage and for storageof graphics commands, data and textures. The MCH 116 is to direct datasignals between the processor 102, memory 120, and other components inthe system 100 and to bridge the data signals between processor bus 110,memory 120, and system I/O 122. In some embodiments, the system logicchip 116 can provide a graphics port for coupling to a graphicscontroller 112. The MCH 116 is coupled to memory 120 through a memoryinterface 118. The graphics card 112 is coupled to the MCH 116 throughan Accelerated Graphics Port (AGP) interconnect 114.

System 100 uses a proprietary hub interface bus 122 to couple the MCH116 to the I/O controller hub (ICH) 130. The ICH 130 provides directconnections to some I/O devices via a local I/O bus. The local I/O busis a high-speed I/O bus for connecting peripherals to the memory 120,chipset, and processor 102. Some examples are the audio controller,firmware hub (flash BIOS) 128, wireless transceiver 126, data storage124, legacy I/O controller containing user input and keyboardinterfaces, a serial expansion port such as Universal Serial Bus (USB),and a network controller 134. The data storage device 124 can comprise ahard disk drive, a floppy disk drive, a CD-ROM device, a flash memorydevice, or other mass storage device.

For another embodiment of a system, an instruction in accordance withone embodiment can be used with a system on a chip. One embodiment of asystem on a chip comprises of a processor and a memory. The memory forone such system is a flash memory. The flash memory can be located onthe same die as the processor and other system components. Additionally,other logic blocks such as a memory controller or graphics controllercan also be located on a system on a chip.

FIG. 1B illustrates a data processing system 140 which implements theprinciples of one embodiment of the present invention. It will bereadily appreciated by one of skill in the art that the embodimentsdescribed herein can be used with alternative processing systems withoutdeparture from the scope of embodiments of the invention.

Computer system 140 comprises a processing core 159 capable ofperforming at least one instruction in accordance with one embodiment.For one embodiment, processing core 159 represents a processing unit ofany type of architecture, including but not limited to a CISC, a RISC ora VLIW type architecture. Processing core 159 may also be suitable formanufacture in one or more process technologies and by being representedon a machine readable media in sufficient detail, may be suitable tofacilitate said manufacture.

Processing core 159 comprises an execution unit 142, a set of registerfile(s) 145, and a decoder 144. Processing core 159 also includesadditional circuitry (not shown) which is not necessary to theunderstanding of embodiments of the present invention. Execution unit142 is used for executing instructions received by processing core 159.In addition to performing typical processor instructions, execution unit142 can perform instructions in packed instruction set 143 forperforming operations on packed data formats. Packed instruction set 143includes instructions for performing embodiments of the invention andother packed instructions. Execution unit 142 is coupled to registerfile 145 by an internal bus. Register file 145 represents a storage areaon processing core 159 for storing information, including data. Aspreviously mentioned, it is understood that the storage area used forstoring the packed data is not critical. Execution unit 142 is coupledto decoder 144. Decoder 144 is used for decoding instructions receivedby processing core 159 into control signals and/or microcode entrypoints. In response to these control signals and/or microcode entrypoints, execution unit 142 performs the appropriate operations. In oneembodiment, the decoder is used to interpret the opcode of theinstruction, which will indicate what operation should be performed onthe corresponding data indicated within the instruction.

Processing core 159 is coupled with bus 141 for communicating withvarious other system devices, which may include but are not limited to,for example, synchronous dynamic random access memory (SDRAM) control146, static random access memory (SRAM) control 147, burst flash memoryinterface 148, personal computer memory card international association(PCMCIA)/compact flash (CF) card control 149, liquid crystal display(LCD) control 150, direct memory access (DMA) controller 151, andalternative bus master interface 152. In one embodiment, data processingsystem 140 may also comprise an I/O bridge 154 for communicating withvarious I/O devices via an I/O bus 153. Such I/O devices may include butare not limited to, for example, universal asynchronousreceiver/transmitter (UART) 155, universal serial bus (USB) 156,Bluetooth wireless UART 157 and I/O expansion interface 158.

One embodiment of data processing system 140 provides for mobile,network and/or wireless communications and a processing core 159 capableof performing SIMD operations including a text string comparisonoperation. Processing core 159 may be programmed with various audio,video, imaging and communications algorithms including discretetransformations such as a Walsh-Hadamard transform, a fast Fouriertransform (FFT), a discrete cosine transform (DCT), and their respectiveinverse transforms; compression/decompression techniques such as colorspace transformation, video encode motion estimation or video decodemotion compensation; and modulation/demodulation (MODEM) functions suchas pulse coded modulation (PCM).

FIG. 1C illustrates another alternative embodiments of a data processingsystem capable of executing instructions to provide SIMD SM3cryptographic hashing functionality. In accordance with one alternativeembodiment, data processing system 160 may include a main processor 166,a SIMD coprocessor 161, a cache memory 167, and an input/output system168. The input/output system 168 may optionally be coupled to a wirelessinterface 169. SIMD coprocessor 161 is capable of performing operationsincluding instructions in accordance with one embodiment. Processingcore 170 may be suitable for manufacture in one or more processtechnologies and by being represented on a machine readable media insufficient detail, may be suitable to facilitate the manufacture of allor part of data processing system 160 including processing core 170.

For one embodiment, SIMD coprocessor 161 comprises an execution unit 162and a set of register file(s) 164. One embodiment of main processor 166comprises a decoder 165 to recognize instructions of instruction set 163including instructions in accordance with one embodiment for executionby execution unit 162. For alternative embodiments, SIMD coprocessor 161also comprises at least part of decoder 165B to decode instructions ofinstruction set 163. Processing core 170 also includes additionalcircuitry (not shown) which is not necessary to the understanding ofembodiments of the present invention.

In operation, the main processor 166 executes a stream of dataprocessing instructions that control data processing operations of ageneral type including interactions with the cache memory 167, and theinput/output system 168. Embedded within the stream of data processinginstructions are SIMD coprocessor instructions. The decoder 165 of mainprocessor 166 recognizes these SIMD coprocessor instructions as being ofa type that should be executed by an attached SIMD coprocessor 161.Accordingly, the main processor 166 issues these SIMD coprocessorinstructions (or control signals representing SIMD coprocessorinstructions) on the coprocessor bus 171 where from they are received byany attached SIMD coprocessors. In this case, the SIMD coprocessor 161will accept and execute any received SIMD coprocessor instructionsintended for it.

Data may be received via wireless interface 169 for processing by theSIMD coprocessor instructions. For one example, voice communication maybe received in the form of a digital signal, which may be processed bythe SIMD coprocessor instructions to regenerate digital audio samplesrepresentative of the voice communications. For another example,compressed audio and/or video may be received in the form of a digitalbit stream, which may be processed by the SIMD coprocessor instructionsto regenerate digital audio samples and/or motion video frames. For oneembodiment of processing core 170, main processor 166, and a SIMDcoprocessor 161 are integrated into a single processing core 170comprising an execution unit 162, a set of register file(s) 164, and adecoder 165 to recognize instructions of instruction set 163 includinginstructions in accordance with one embodiment.

FIG. 2 is a block diagram of the micro-architecture for a processor 200that includes logic circuits to perform instructions in accordance withone embodiment of the present invention. In some embodiments, aninstruction in accordance with one embodiment can be implemented tooperate on data elements having sizes of byte, word, doubleword,quadword, etc., as well as datatypes, such as single and doubleprecision integer and floating point datatypes. In one embodiment thein-order front end 201 is the part of the processor 200 that fetchesinstructions to be executed and prepares them to be used later in theprocessor pipeline. The front end 201 may include several units. In oneembodiment, the instruction prefetcher 226 fetches instructions frommemory and feeds them to an instruction decoder 228 which in turndecodes or interprets them. For example, in one embodiment, the decoderdecodes a received instruction into one or more operations called“micro-instructions” or “micro-operations” (also called micro op oruops) that the machine can execute. In other embodiments, the decoderparses the instruction into an opcode and corresponding data and controlfields that are used by the micro-architecture to perform operations inaccordance with one embodiment. In one embodiment, the trace cache 230takes decoded uops and assembles them into program ordered sequences ortraces in the uop queue 234 for execution. When the trace cache 230encounters a complex instruction, the microcode ROM 232 provides theuops needed to complete the operation.

Some instructions are converted into a single micro-op, whereas othersneed several micro-ops to complete the full operation. In oneembodiment, if more than four micro-ops are needed to complete ainstruction, the decoder 228 accesses the microcode ROM 232 to do theinstruction. For one embodiment, an instruction can be decoded into asmall number of micro ops for processing at the instruction decoder 228.In another embodiment, an instruction can be stored within the microcodeROM 232 should a number of micro-ops be needed to accomplish theoperation. The trace cache 230 refers to a entry point programmablelogic array (PLA) to determine a correct micro-instruction pointer forreading the micro-code sequences to complete one or more instructions inaccordance with one embodiment from the micro-code ROM 232. After themicrocode ROM 232 finishes sequencing micro-ops for an instruction, thefront end 201 of the machine resumes fetching micro-ops from the tracecache 230.

The out-of-order execution engine 203 is where the instructions areprepared for execution. The out-of-order execution logic has a number ofbuffers to smooth out and re-order the flow of instructions to optimizeperformance as they go down the pipeline and get scheduled forexecution. The allocator logic allocates the machine buffers andresources that each uop needs in order to execute. The register renaminglogic renames logic registers onto entries in a register file. Theallocator also allocates an entry for each uop in one of the two uopqueues, one for memory operations and one for non-memory operations, infront of the instruction schedulers: memory scheduler, fast scheduler202, slow/general floating point scheduler 204, and simple floatingpoint scheduler 206. The uop schedulers 202, 204, 206, determine when auop is ready to execute based on the readiness of their dependent inputregister operand sources and the availability of the execution resourcesthe uops need to complete their operation. The fast scheduler 202 of oneembodiment can schedule on each half of the main clock cycle while theother schedulers can only schedule once per main processor clock cycle.The schedulers arbitrate for the dispatch ports to schedule uops forexecution.

Register files 208, 210, sit between the schedulers 202, 204, 206, andthe execution units 212, 214, 216, 218, 220, 222, 224 in the executionblock 211. There is a separate register file 208, 210, for integer andfloating point operations, respectively. Each register file 208, 210, ofone embodiment also includes a bypass network that can bypass or forwardjust completed results that have not yet been written into the registerfile to new dependent uops. The integer register file 208 and thefloating point register file 210 are also capable of communicating datawith the other. For one embodiment, the integer register file 208 issplit into two separate register files, one register file for the loworder 32 bits of data and a second register file for the high order 32bits of data. The floating point register file 210 of one embodiment has128 bit wide entries because floating point instructions typically haveoperands from 64 to 128 bits in width.

The execution block 211 contains the execution units 212, 214, 216, 218,220, 222, 224, where the instructions are actually executed. Thissection includes the register files 208, 210, that store the integer andfloating point data operand values that the micro-instructions need toexecute. The processor 200 of one embodiment is comprised of a number ofexecution units: address generation unit (AGU) 212, AGU 214, fast ALU216, fast ALU 218, slow ALU 220, floating point ALU 222, floating pointmove unit 224. For one embodiment, the floating point execution blocks222, 224, execute floating point, MMX, SIMD, and SSE, or otheroperations. The floating point ALU 222 of one embodiment includes a 64bit by 64 bit floating point divider to execute divide, square root, andremainder micro-ops. For embodiments of the present invention,instructions involving a floating point value may be handled with thefloating point hardware. In one embodiment, the ALU operations go to thehigh-speed ALU execution units 216, 218. The fast ALUs 216, 218, of oneembodiment can execute fast operations with an effective latency of halfa clock cycle. For one embodiment, most complex integer operations go tothe slow ALU 220 as the slow ALU 220 includes integer execution hardwarefor long latency type of operations, such as a multiplier, shifts, flaglogic, and branch processing. Memory load/store operations are executedby the AGUs 212, 214. For one embodiment, the integer ALUs 216, 218,220, are described in the context of performing integer operations on 64bit data operands. In alternative embodiments, the ALUs 216, 218, 220,can be implemented to support a variety of data bits including 16, 32,128, 256, etc. Similarly, the floating point units 222, 224, can beimplemented to support a range of operands having bits of variouswidths. For one embodiment, the floating point units 222, 224, canoperate on 128 bits wide packed data operands in conjunction with SIMDand multimedia instructions.

In one embodiment, the uops schedulers 202, 204, 206, dispatch dependentoperations before the parent load has finished executing. As uops arespeculatively scheduled and executed in processor 200, the processor 200also includes logic to handle memory misses. If a data load misses inthe data cache, there can be dependent operations in flight in thepipeline that have left the scheduler with temporarily incorrect data. Areplay mechanism tracks and re-executes instructions that use incorrectdata. Only the dependent operations need to be replayed and theindependent ones are allowed to complete. The schedulers and replaymechanism of one embodiment of a processor are also designed to catchinstructions that provide SIMD SM3 cryptographic hashing functionality.

The term “registers” may refer to the on-board processor storagelocations that are used as part of instructions to identify operands. Inother words, registers may be those that are usable from the outside ofthe processor (from a programmer's perspective). However, the registersof an embodiment should not be limited in meaning to a particular typeof circuit. Rather, a register of an embodiment is capable of storingand providing data, and performing the functions described herein. Theregisters described herein can be implemented by circuitry within aprocessor using any number of different techniques, such as dedicatedphysical registers, dynamically allocated physical registers usingregister renaming, combinations of dedicated and dynamically allocatedphysical registers, etc. In one embodiment, integer registers storethirty-two bit integer data. A register file of one embodiment alsocontains eight multimedia SIMD registers for packed data. For thediscussions below, the registers are understood to be data registersdesigned to hold packed data, such as 64 bits wide MMX™ registers (alsoreferred to as ‘mm’ registers in some instances) in microprocessorsenabled with MMX technology from Intel Corporation of Santa Clara,Calif. These MMX registers, available in both integer and floating pointforms, can operate with packed data elements that accompany SIMD and SSEinstructions. Similarly, 128 bits wide XMM registers relating to SSE2,SSE3, SSE4, or beyond (referred to generically as “SSEx”) technology canalso be used to hold such packed data operands. In one embodiment, instoring packed data and integer data, the registers do not need todifferentiate between the two data types. In one embodiment, integer andfloating point are either contained in the same register file ordifferent register files. Furthermore, in one embodiment, floating pointand integer data may be stored in different registers or the sameregisters.

In the examples of the following figures, a number of data operands aredescribed. FIG. 3A illustrates various packed data type representationsin multimedia registers according to one embodiment of the presentinvention. FIG. 3A illustrates data types for a packed byte 310, apacked word 320, and a packed doubleword (dword) 330 for 128 bits wideoperands. The packed byte format 310 of this example is 128 bits longand contains sixteen packed byte data elements. A byte is defined hereas 8 bits of data. Information for each byte data element is stored inbit 7 through bit 0 for byte 0, bit 15 through bit 8 for byte 1, bit 23through bit 16 for byte 2, and finally bit 120 through bit 127 for byte15. Thus, all available bits are used in the register. This storagearrangement increases the storage efficiency of the processor. As well,with sixteen data elements accessed, one operation can now be performedon sixteen data elements in parallel.

Generally, a data element is an individual piece of data that is storedin a single register or memory location with other data elements of thesame length. In packed data sequences relating to SSEx technology, thenumber of data elements stored in a XMM register is 128 bits divided bythe length in bits of an individual data element. Similarly, in packeddata sequences relating to MMX and SSE technology, the number of dataelements stored in an MMX register is 64 bits divided by the length inbits of an individual data element. Although the data types illustratedin FIG. 3A are 128 bit long, embodiments of the present invention canalso operate with 64 bit wide, 256 bit wide, 512 bit wide, or othersized operands. The packed word format 320 of this example is 128 bitslong and contains eight packed word data elements. Each packed wordcontains sixteen bits of information. The packed doubleword format 330of FIG. 3A is 128 bits long and contains four packed doubleword dataelements. Each packed doubleword data element contains thirty two bitsof information. A packed quadword is 128 bits long and contains twopacked quad-word data elements.

FIG. 3B illustrates alternative in-register data storage formats. Eachpacked data can include more than one independent data element. Threepacked data formats are illustrated; packed half 341, packed single 342,and packed double 343. One embodiment of packed half 341, packed single342, and packed double 343 contain fixed-point data elements. For analternative embodiment one or more of packed half 341, packed single342, and packed double 343 may contain floating-point data elements. Onealternative embodiment of packed half 341 is one hundred twenty-eightbits long containing eight 16-bit data elements. One embodiment ofpacked single 342 is one hundred twenty-eight bits long and containsfour 32-bit data elements. One embodiment of packed double 343 is onehundred twenty-eight bits long and contains two 64-bit data elements. Itwill be appreciated that such packed data formats may be furtherextended to other register lengths, for example, to 96-bits, 160-bits,192-bits, 224-bits, 256-bits, 512-bits or more.

FIG. 3C illustrates various signed and unsigned packed data typerepresentations in multimedia registers according to one embodiment ofthe present invention. Unsigned packed byte representation 344illustrates the storage of an unsigned packed byte in a SIMD register.Information for each byte data element is stored in bit seven throughbit zero for byte zero, bit fifteen through bit eight for byte one, bittwenty-three through bit sixteen for byte two, etc., and finally bit onehundred twenty through bit one hundred twenty-seven for byte fifteen.Thus, all available bits are used in the register. This storagearrangement can increase the storage efficiency of the processor. Aswell, with sixteen data elements accessed, one operation can now beperformed on sixteen data elements in a parallel fashion. Signed packedbyte representation 345 illustrates the storage of a signed packed byte.Note that the eighth bit of every byte data element is the signindicator. Unsigned packed word representation 346 illustrates how wordseven through word zero are stored in a SIMD register. Signed packedword representation 347 is similar to the unsigned packed wordin-register representation 346. Note that the sixteenth bit of each worddata element is the sign indicator. Unsigned packed doublewordrepresentation 348 shows how doubleword data elements are stored. Signedpacked doubleword representation 349 is similar to unsigned packeddoubleword in-register representation 348. Note that the necessary signbit is the thirty-second bit of each doubleword data element.

FIG. 3D is a depiction of one embodiment of an operation encoding(opcode) format 360, having thirty-two or more bits, and register/memoryoperand addressing modes corresponding with a type of opcode formatdescribed in the “Intel® 64 and IA-32 Intel Architecture SoftwareDeveloper's Manual Combined Volumes 2A and 2B: Instruction Set ReferenceA-Z,” which is which is available from Intel Corporation, Santa Clara,Calif. on the world-wide-web (www) atintel.com/products/processor/manuals/. In one embodiment, andinstruction may be encoded by one or more of fields 361 and 362. Up totwo operand locations per instruction may be identified, including up totwo source operand identifiers 364 and 365. For one embodiment,destination operand identifier 366 is the same as source operandidentifier 364, whereas in other embodiments they are different. For analternative embodiment, destination operand identifier 366 is the sameas source operand identifier 365, whereas in other embodiments they aredifferent. In one embodiment, one of the source operands identified bysource operand identifiers 364 and 365 is overwritten by the results ofthe instruction, whereas in other embodiments identifier 364 correspondsto a source register element and identifier 365 corresponds to adestination register element. For one embodiment, operand identifiers364 and 365 may be used to identify 32-bit or 64-bit source anddestination operands.

FIG. 3E is a depiction of another alternative operation encoding(opcode) format 370, having forty or more bits. Opcode format 370corresponds with opcode format 360 and comprises an optional prefix byte378. An instruction according to one embodiment may be encoded by one ormore of fields 378, 371, and 372. Up to two operand locations perinstruction may be identified by source operand identifiers 374 and 375and by prefix byte 378. For one embodiment, prefix byte 378 may be usedto identify 32-bit or 64-bit source and destination operands. For oneembodiment, destination operand identifier 376 is the same as sourceoperand identifier 374, whereas in other embodiments they are different.For an alternative embodiment, destination operand identifier 376 is thesame as source operand identifier 375, whereas in other embodiments theyare different. In one embodiment, an instruction operates on one or moreof the operands identified by operand identifiers 374 and 375 and one ormore operands identified by the operand identifiers 374 and 375 isoverwritten by the results of the instruction, whereas in otherembodiments, operands identified by identifiers 374 and 375 are writtento another data element in another register. Opcode formats 360 and 370allow register to register, memory to register, register by memory,register by register, register by immediate, register to memoryaddressing specified in part by MOD fields 363 and 373 and by optionalscale-index-base and displacement bytes.

Turning next to FIG. 3F, in some alternative embodiments, 64-bit (or128-bit, or 256-bit, or 512-bit or more) single instruction multipledata (SIMD) arithmetic operations may be performed through a coprocessordata processing (CDP) instruction. Operation encoding (opcode) format380 depicts one such CDP instruction having CDP opcode fields 382 and389. The type of CDP instruction, for alternative embodiments,operations may be encoded by one or more of fields 383, 384, 387, and388. Up to three operand locations per instruction may be identified,including up to two source operand identifiers 385 and 390 and onedestination operand identifier 386. One embodiment of the coprocessorcan operate on 8, 16, 32, and 64 bit values. For one embodiment, aninstruction is performed on integer data elements. In some embodiments,an instruction may be executed conditionally, using condition field 381.For some embodiments, source data sizes may be encoded by field 383. Insome embodiments, Zero (Z), negative (N), carry (C), and overflow (V)detection can be done on SIMD fields. For some instructions, the type ofsaturation may be encoded by field 384.

Turning next to FIG. 3G is a depiction of another alternative operationencoding (opcode) format 397, to provide SIMD SM3 cryptographic hashingfunctionality according to another embodiment, corresponding with a typeof opcode format described in the “Intel® Advanced Vector ExtensionsProgramming Reference,” which is available from Intel Corp., SantaClara, Calif. on the world-wide-web (www) atintel.com/products/processor/manuals/.

The original x86 instruction set provided for a 1-byte opcode withvarious formats of address syllable and immediate operand contained inadditional bytes whose presence was known from the first “opcode” byte.Additionally, there were certain byte values that were reserved asmodifiers to the opcode (called prefixes, as they had to be placedbefore the instruction). When the original palette of 256 opcode bytes(including these special prefix values) was exhausted, a single byte wasdedicated as an escape to a new set of 256 opcodes. As vectorinstructions (e.g., SIMD) were added, a need for more opcodes wasgenerated, and the “two byte” opcode map also was insufficient, evenwhen expanded through the use of prefixes. To this end, new instructionswere added in additional maps which use 2 bytes plus an optional prefixas an identifier.

Additionally, in order to facilitate additional registers in 64-bitmode, an additional prefix may be used (called “REX”) in between theprefixes and the opcode (and any escape bytes necessary to determine theopcode). In one embodiment, the REX may have 4 “payload” bits toindicate use of additional registers in 64-bit mode. In otherembodiments it may have fewer or more than 4 bits. The general format ofat least one instruction set (which corresponds generally with format360 and/or format 370) is illustrated generically by the following:

-   -   [prefixes] [rex] escape [escape2] opcode modrm (etc.)

Opcode format 397 corresponds with opcode format 370 and comprisesoptional VEX prefix bytes 391 (beginning with C4 hex in one embodiment)to replace most other commonly used legacy instruction prefix bytes andescape codes. For example, the following illustrates an embodiment usingtwo fields to encode an instruction, which may be used when a secondescape code is present in the original instruction, or when extra bits(e.g, the XB and W fields) in the REX field need to be used. In theembodiment illustrated below, legacy escape is represented by a newescape value, legacy prefixes are fully compressed as part of the“payload” bytes, legacy prefixes are reclaimed and available for futureexpansion, the second escape code is compressed in a “map” field, withfuture map or feature space available, and new features are added (e.g.,increased vector length and an additional source register specifier).

An instruction according to one embodiment may be encoded by one or moreof fields 391 and 392. Up to four operand locations per instruction maybe identified by field 391 in combination with source operandidentifiers 374 and 375 and in combination with an optionalscale-index-base (SIB) identifier 393, an optional displacementidentifier 394, and an optional immediate byte 395. For one embodiment,VEX prefix bytes 391 may be used to identify 32-bit or 64-bit source anddestination operands and/or 128-bit or 256-bit SIMD register or memoryoperands. For one embodiment, the functionality provided by opcodeformat 397 may be redundant with opcode format 370, whereas in otherembodiments they are different. Opcode formats 370 and 397 allowregister to register, memory to register, register by memory, registerby register, register by immediate, register to memory addressingspecified in part by MOD field 373 and by optional (SIB) identifier 393,an optional displacement identifier 394, and an optional immediate byte395.

Turning next to FIG. 3H is a depiction of another alternative operationencoding (opcode) format 398, to provide SIMD SM3 cryptographic hashingfunctionality according to another embodiment. Opcode format 398corresponds with opcode formats 370 and 397 and comprises optional EVEXprefix bytes 396 (beginning with 62 hex in one embodiment) to replacemost other commonly used legacy instruction prefix bytes and escapecodes and provide additional functionality. An instruction according toone embodiment may be encoded by one or more of fields 396 and 392. Upto four operand locations per instruction and a mask may be identifiedby field 396 in combination with source operand identifiers 374 and 375and in combination with an optional scale-index-base (SIB) identifier393, an optional displacement identifier 394, and an optional immediatebyte 395. For one embodiment, EVEX prefix bytes 396 may be used toidentify 32-bit or 64-bit source and destination operands and/or128-bit, 256-bit or 512-bit SIMD register or memory operands. For oneembodiment, the functionality provided by opcode format 398 may beredundant with opcode formats 370 or 397, whereas in other embodimentsthey are different. Opcode format 398 allows register to register,memory to register, register by memory, register by register, registerby immediate, register to memory addressing, with masks, specified inpart by MOD field 373 and by optional (SIB) identifier 393, an optionaldisplacement identifier 394, and an optional immediate byte 395. Thegeneral format of at least one instruction set (which correspondsgenerally with format 360 and/or format 370) is illustrated genericallyby the following:

evex1 RXBmmmmm WvvvLpp evex4 opcode modrm [sib] [disp] [imm]

For one embodiment an instruction encoded according to the EVEX format398 may have additional “payload” bits that may be used to provide SIMDSM3 cryptographic hashing functionality with additional new featuressuch as, for example, a user configurable mask register, or anadditional operand, or selections from among 128-bit, 256-bit or 512-bitvector registers, or more registers from which to select, etc.

For example, where VEX format 397 may be used to provide SIMD SM3cryptographic hashing functionality with an implicit mask, the EVEXformat 398 may be used to provide SIMD SM3 cryptographic hashingfunctionality with an explicit user configurable mask. Additionally,where VEX format 397 may be used to provide SIMD SM3 cryptographichashing functionality on 128-bit or 256-bit vector registers, EVEXformat 398 may be used to provide SIMD SM3 cryptographic hashingfunctionality on 128-bit, 256-bit, 512-bit or larger (or smaller) vectorregisters.

Example instructions to provide SIMD SM3 cryptographic hashingfunctionality are illustrated by the following examples:

source1/ Instruction destination source2 source3 source4 descriptionSM3-round-I4 Ymm1 Ymm2 Ymm3 Imm8 Perform four iterations of the SM3rounds indicated by Imm8 using the 256-bit starting state A, B, C, D, E,F, G, H, in Ymm1, the eight 32-bit message words Wj in Ymm2, and eitherone or four precalculated 32-bit constants Tj in Ymm3. Store the 256-bitresulting state in Ymm1. SM3-round-I2 Zmm1 Zmm2 Zmm3 Imm8 Perform twoiterations of the SM3 rounds indicated by Imm8 in each 256-bit lane,using two 256-bit starting states A, B, C, D, E, F, G, H in Zmm1, twosets of eight 32-bit message words Wj in Zmm2, and either one or twoprecalculated 32-bit constants Tj from each lane in Zmm3. Store two256-bit resulting states in Zmm1. SM3-rounds Ymm1 Ymm2 Imm8 Perform anumber of iterations of the SM3 rounds (0-63) indicated by Imm8 usingthe 256-bit starting state A, B, C, D, E, F, G, H, in Ymm1, and eight32-bit message words Wj in Ymm2. Store the 256-bit resulting state inYmm1. SM3-expand-J4 Ymm1 Ymm2 Ymm3 Perform four SM3 message expansionsusing eight 32-bit message words Wj in Ymm2, and eight 32-bit messagewords Wj in Ymm3. Store the four latest and the four new message wordsWj in Vmm1. SM3-expand-J2 Zmm1 Zmm2 Zmm3 Perform two SM3 messageexpansions, in each 256-bit lane, using eight 32-bit message words Wj inZmm2, and eight 32-bit message words Wj in Zmm3. Store six latest andtwo new message words Wj in each 256-bit lane of Zmm1.

It will be appreciated that SIMD SM3 cryptographic hashing instructions,as in the examples above, may be used to provide SIMD SM3 cryptographichashing functionality in applications, such as cryptographic protocolsand Internet communication to assure data integrity, digital signatures,identity verification, message content authentication and message originauthentication for financial transactions, electronic commerce,electronic mail, software distribution, data storage, random numbergeneration, and so on.

It will also be appreciated that providing SIMD SM3 cryptographichashing instructions, which perform a pre-specified number of iterationsof the hashing round, may enable SIMD execution of the hashing algorithmin a processor pipeline concurrently with other SIMD processing andscalar processing, such as preprocessing of message “chunks” andpreparing pre-rotated round constants (e.g. T_(j)<<<j) according to thespecific hashing algorithm implementation. That is to say that, where asingle iteration of a hashing round may have a pipeline latency of threecycles (e.g. 3 cycles per round), by bypassing results back through thepipeline, two iterations may have a latency of only four cycles (e.g. 2cycles per round), four iterations may have a latency of only six cycles(e.g. 1.5 cycles per round). During those pipeline latencies of four orsix cycles, other useful processing may be performed in parallel orconcurrently with the hashing round slice. Thus providing an instructionfor a SIMD secure hashing algorithm round slice, which has a number ofiterations (e.g. two, four or eight iterations per slice) but less thatthe total number of round iterations of the hash algorithm, permitsconcurrent execution of other instructions in a superscalar executionpipeline, and/or an out-of-order processor pipeline, therebysignificantly improving processing throughput, and leveraging thescaling of frequencies for fabrication process improvements associatedwith general purpose processors.

Some embodiments include a processor comprising a decoder to decodeinstructions for a SIMD SM3 message expansion, specifying first andsecond source data operand sets, and an expansion extent. Processorexecution units, responsive to the instruction, perform a number of SM3message expansions, from the first and second source data operand sets,determined by the specified expansion extent and store the result into aSIMD destination register. Some embodiments also execute instructionsfor a SIMD SM3 hash round-slice portion of the hashing algorithm, froman intermediate hash value input, a source data set, and a roundconstant set (e.g. having one or more pre-rotated constant T_(j)<<<j).Processor execution units perform a set of SM3 hashing round iterationsupon the source data set, applying the intermediate hash value input andthe round constant set, and store a new hash value result in a SIMDdestination register.

For some embodiments of SIMD instructions and processing logic toprovide SM3 cryptographic hashing functionality, both SM3 messageexpansion and SM3 cryptographic hash rounds may be performed in slicesof iterations concurrently and/or in parallel in a standard executionpipeline of a modern microprocessor. It will be appreciated that thenumber of iterations per slice may be conveniently chosen so as toprovide a sufficient cover for other concurrent in-flight instructionsby the latencies associated with performing a slice of SM3 messageexpansions and/or a slice of SM3 cryptographic hash rounds. Thus it willalso be appreciated that providing execution of an instruction for aSIMD SM3 cryptographic hashing algorithm round slice, which has a numberof iterations (e.g. two, four or eight iterations per slice) but lessthat the total number of round iterations of the hash algorithm, permitsconcurrent execution of such other required instructions (e.g. SM3message expansion instructions) in a superscalar execution pipeline,and/or in an out-of-order processor pipeline, thereby significantlyimproving processing throughput for a large number of applications, andleveraging the scaling of frequencies for fabrication processimprovements associated with general purpose processors.

FIG. 4A is a block diagram illustrating an in-order pipeline and aregister renaming stage, out-of-order issue/execution pipeline accordingto at least one embodiment of the invention. FIG. 4B is a block diagramillustrating an in-order architecture core and a register renaminglogic, out-of-order issue/execution logic to be included in a processoraccording to at least one embodiment of the invention. The solid linedboxes in FIG. 4A illustrate the in-order pipeline, while the dashedlined boxes illustrates the register renaming, out-of-orderissue/execution pipeline. Similarly, the solid lined boxes in FIG. 4Billustrate the in-order architecture logic, while the dashed lined boxesillustrates the register renaming logic and out-of-order issue/executionlogic.

In FIG. 4A, a processor pipeline 400 includes a fetch stage 402, alength decode stage 404, a decode stage 406, an allocation stage 408, arenaming stage 410, a scheduling (also known as a dispatch or issue)stage 412, a register read/memory read stage 414, an execute stage 416,a write back/memory write stage 418, an exception handling stage 422,and a commit stage 424.

In FIG. 4B, arrows denote a coupling between two or more units and thedirection of the arrow indicates a direction of data flow between thoseunits. FIG. 4B shows processor core 490 including a front end unit 430coupled to an execution engine unit 450, and both are coupled to amemory unit 470.

The core 490 may be a reduced instruction set computing (RISC) core, acomplex instruction set computing (CISC) core, a very long instructionword (VLIW) core, or a hybrid or alternative core type. As yet anotheroption, the core 490 may be a special-purpose core, such as, forexample, a network or communication core, compression engine, graphicscore, or the like.

The front end unit 430 includes a branch prediction unit 432 coupled toan instruction cache unit 434, which is coupled to an instructiontranslation lookaside buffer (TLB) 436, which is coupled to aninstruction fetch unit 438, which is coupled to a decode unit 440. Thedecode unit or decoder may decode instructions, and generate as anoutput one or more micro-operations, micro-code entry points,microinstructions, other instructions, or other control signals, whichare decoded from, or which otherwise reflect, or are derived from, theoriginal instructions. The decoder may be implemented using variousdifferent mechanisms. Examples of suitable mechanisms include, but arenot limited to, look-up tables, hardware implementations, programmablelogic arrays (PLAs), microcode read only memories (ROMs), etc. Theinstruction cache unit 434 is further coupled to a level 2 (L2) cacheunit 476 in the memory unit 470. The decode unit 440 is coupled to arename/allocator unit 452 in the execution engine unit 450.

The execution engine unit 450 includes the rename/allocator unit 452coupled to a retirement unit 454 and a set of one or more schedulerunit(s) 456. The scheduler unit(s) 456 represents any number ofdifferent schedulers, including reservations stations, centralinstruction window, etc. The scheduler unit(s) 456 is coupled to thephysical register file(s) unit(s) 458. Each of the physical registerfile(s) units 458 represents one or more physical register files,different ones of which store one or more different data types, such asscalar integer, scalar floating point, packed integer, packed floatingpoint, vector integer, vector floating point, etc., status (e.g., aninstruction pointer that is the address of the next instruction to beexecuted), etc. The physical register file(s) unit(s) 458 is overlappedby the retirement unit 454 to illustrate various ways in which registerrenaming and out-of-order execution may be implemented (e.g., using areorder buffer(s) and a retirement register file(s), using a futurefile(s), a history buffer(s), and a retirement register file(s); using aregister maps and a pool of registers; etc.). Generally, thearchitectural registers are visible from the outside of the processor orfrom a programmer's perspective. The registers are not limited to anyknown particular type of circuit. Various different types of registersare suitable as long as they are capable of storing and providing dataas described herein. Examples of suitable registers include, but are notlimited to, dedicated physical registers, dynamically allocated physicalregisters using register renaming, combinations of dedicated anddynamically allocated physical registers, etc. The retirement unit 454and the physical register file(s) unit(s) 458 are coupled to theexecution cluster(s) 460. The execution cluster(s) 460 includes a set ofone or more execution units 462 and a set of one or more memory accessunits 464. The execution units 462 may perform various operations (e.g.,shifts, addition, subtraction, multiplication) and on various types ofdata (e.g., scalar floating point, packed integer, packed floatingpoint, vector integer, vector floating point). While some embodimentsmay include a number of execution units dedicated to specific functionsor sets of functions, other embodiments may include only one executionunit or multiple execution units that all perform all functions. Thescheduler unit(s) 456, physical register file(s) unit(s) 458, andexecution cluster(s) 460 are shown as being possibly plural becausecertain embodiments create separate pipelines for certain types ofdata/operations (e.g., a scalar integer pipeline, a scalar floatingpoint/packed integer/packed floating point/vector integer/vectorfloating point pipeline, and/or a memory access pipeline that each havetheir own scheduler unit, physical register file(s) unit, and/orexecution cluster, and in the case of a separate memory access pipeline,certain embodiments are implemented in which only the execution clusterof this pipeline has the memory access unit(s) 464). It should also beunderstood that where separate pipelines are used, one or more of thesepipelines may be out-of-order issue/execution and the rest in-order.

The set of memory access units 464 is coupled to the memory unit 470,which includes a data TLB unit 472 coupled to a data cache unit 474coupled to a level 2 (L2) cache unit 476. In one exemplary embodiment,the memory access units 464 may include a load unit, a store addressunit, and a store data unit, each of which is coupled to the data TLBunit 472 in the memory unit 470. The L2 cache unit 476 is coupled to oneor more other levels of cache and eventually to a main memory.

By way of example, the exemplary register renaming, out-of-orderissue/execution core architecture may implement the pipeline 400 asfollows: 1) the instruction fetch 438 performs the fetch and lengthdecoding stages 402 and 404; 2) the decode unit 440 performs the decodestage 406; 3) the rename/allocator unit 452 performs the allocationstage 408 and renaming stage 410; 4) the scheduler unit(s) 456 performsthe schedule stage 412; 5) the physical register file(s) unit(s) 458 andthe memory unit 470 perform the register read/memory read stage 414; theexecution cluster 460 perform the execute stage 416; 6) the memory unit470 and the physical register file(s) unit(s) 458 perform the writeback/memory write stage 418; 7) various units may be involved in theexception handling stage 422; and 8) the retirement unit 454 and thephysical register file(s) unit(s) 458 perform the commit stage 424.

The core 490 may support one or more instructions sets (e.g., the x86instruction set (with some extensions that have been added with newerversions); the MIPS instruction set of MIPS Technologies of Sunnyvale,Calif.; the ARM instruction set (with optional additional extensionssuch as NEON) of ARM Holdings of Sunnyvale, Calif.).

It should be understood that the core may support multithreading(executing two or more parallel sets of operations or threads), and maydo so in a variety of ways including time sliced multithreading,simultaneous multithreading (where a single physical core provides alogical core for each of the threads that physical core issimultaneously multithreading), or a combination thereof (e.g., timesliced fetching and decoding and simultaneous multithreading thereaftersuch as in the Intel® Hyperthreading technology).

While register renaming is described in the context of out-of-orderexecution, it should be understood that register renaming may be used inan in-order architecture. While the illustrated embodiment of theprocessor also includes a separate instruction and data cache units434/474 and a shared L2 cache unit 476, alternative embodiments may havea single internal cache for both instructions and data, such as, forexample, a Level 1 (L1) internal cache, or multiple levels of internalcache. In some embodiments, the system may include a combination of aninternal cache and an external cache that is external to the core and/orthe processor. Alternatively, all of the cache may be external to thecore and/or the processor.

FIG. 5 is a block diagram of a single core processor and a multicoreprocessor 500 with integrated memory controller and graphics accordingto embodiments of the invention. The solid lined boxes in FIG. 5illustrate a processor 500 with a single core 502A, a system agent 510,a set of one or more bus controller units 516, while the optionaladdition of the dashed lined boxes illustrates an alternative processor500 with multiple cores 502A-N, a set of one or more integrated memorycontroller unit(s) 514 in the system agent unit 510, and an integratedgraphics logic 508.

The memory hierarchy includes one or more levels of cache within thecores, a set or one or more shared cache units 506, and external memory(not shown) coupled to the set of integrated memory controller units514. The set of shared cache units 506 may include one or more mid-levelcaches, such as level 2 (L2), level 3 (L3), level 4 (L4), or otherlevels of cache, a last level cache (LLC), and/or combinations thereof.While in one embodiment a ring based interconnect unit 512 interconnectsthe integrated graphics logic 508, the set of shared cache units 506,and the system agent unit 510, alternative embodiments may use anynumber of well-known techniques for interconnecting such units.

In some embodiments, one or more of the cores 502A-N are capable ofmulti-threading. The system agent 510 includes those componentscoordinating and operating cores 502A-N. The system agent unit 510 mayinclude for example a power control unit (PCU) and a display unit. ThePCU may be or include logic and components needed for regulating thepower state of the cores 502A-N and the integrated graphics logic 508.The display unit is for driving one or more externally connecteddisplays.

The cores 502A-N may be homogenous or heterogeneous in terms ofarchitecture and/or instruction set. For example, some of the cores502A-N may be in order while others are out-of-order. As anotherexample, two or more of the cores 502A-N may be capable of execution thesame instruction set, while others may be capable of executing only asubset of that instruction set or a different instruction set.

The processor may be a general-purpose processor, such as a Core™ i3,i5, i7, 2 Duo and Quad, Xeon™, Itanium™, XScale™ or StrongARM™processor, which are available from Intel Corporation, of Santa Clara,Calif. Alternatively, the processor may be from another company, such asARM Holdings, Ltd, MIPS, etc. The processor may be a special-purposeprocessor, such as, for example, a network or communication processor,compression engine, graphics processor, co-processor, embeddedprocessor, or the like. The processor may be implemented on one or morechips. The processor 500 may be a part of and/or may be implemented onone or more substrates using any of a number of process technologies,such as, for example, BiCMOS, CMOS, or NMOS.

FIGS. 6-8 are exemplary systems suitable for including the processor500, while FIG. 9 is an exemplary system on a chip (SoC) that mayinclude one or more of the cores 502. Other system designs andconfigurations known in the arts for laptops, desktops, handheld PCs,personal digital assistants, engineering workstations, servers, networkdevices, network hubs, switches, embedded processors, digital signalprocessors (DSPs), graphics devices, video game devices, set-top boxes,micro controllers, cell phones, portable media players, hand helddevices, and various other electronic devices, are also suitable. Ingeneral, a huge variety of systems or electronic devices capable ofincorporating a processor and/or other execution logic as disclosedherein are generally suitable.

Referring now to FIG. 6, shown is a block diagram of a system 600 inaccordance with one embodiment of the present invention. The system 600may include one or more processors 610, 615, which are coupled tographics memory controller hub (GMCH) 620. The optional nature ofadditional processors 615 is denoted in FIG. 6 with broken lines.

Each processor 610,615 may be some version of the processor 500.However, it should be noted that it is unlikely that integrated graphicslogic and integrated memory control units would exist in the processors610,615. FIG. 6 illustrates that the GMCH 620 may be coupled to a memory640 that may be, for example, a dynamic random access memory (DRAM). TheDRAM may, for at least one embodiment, be associated with a non-volatilecache.

The GMCH 620 may be a chipset, or a portion of a chipset. The GMCH 620may communicate with the processor(s) 610, 615 and control interactionbetween the processor(s) 610, 615 and memory 640. The GMCH 620 may alsoact as an accelerated bus interface between the processor(s) 610, 615and other elements of the system 600. For at least one embodiment, theGMCH 620 communicates with the processor(s) 610, 615 via a multi-dropbus, such as a frontside bus (FSB) 695.

Furthermore, GMCH 620 is coupled to a display 645 (such as a flat paneldisplay). GMCH 620 may include an integrated graphics accelerator. GMCH620 is further coupled to an input/output (I/O) controller hub (ICH)650, which may be used to couple various peripheral devices to system600. Shown for example in the embodiment of FIG. 6 is an externalgraphics device 660, which may be a discrete graphics device coupled toICH 650, along with another peripheral device 670.

Alternatively, additional or different processors may also be present inthe system 600. For example, additional processor(s) 615 may includeadditional processors(s) that are the same as processor 610, additionalprocessor(s) that are heterogeneous or asymmetric to processor 610,accelerators (such as, e.g., graphics accelerators or digital signalprocessing (DSP) units), field programmable gate arrays, or any otherprocessor. There can be a variety of differences between the physicalresources 610, 615 in terms of a spectrum of metrics of merit includingarchitectural, micro-architectural, thermal, power consumptioncharacteristics, and the like. These differences may effectivelymanifest themselves as asymmetry and heterogeneity amongst theprocessors 610, 615. For at least one embodiment, the various processors610, 615 may reside in the same die package.

Referring now to FIG. 7, shown is a block diagram of a second system 700in accordance with an embodiment of the present invention. As shown inFIG. 7, multiprocessor system 700 is a point-to-point interconnectsystem, and includes a first processor 770 and a second processor 780coupled via a point-to-point interconnect 750. Each of processors 770and 780 may be some version of the processor 500 as one or more of theprocessors 610,615.

While shown with only two processors 770, 780, it is to be understoodthat the scope of the present invention is not so limited. In otherembodiments, one or more additional processors may be present in a givenprocessor.

Processors 770 and 780 are shown including integrated memory controllerunits 772 and 782, respectively. Processor 770 also includes as part ofits bus controller units point-to-point (P-P) interfaces 776 and 778;similarly, second processor 780 includes P-P interfaces 786 and 788.Processors 770, 780 may exchange information via a point-to-point (P-P)interface 750 using P-P interface circuits 778, 788. As shown in FIG. 7,IMCs 772 and 782 couple the processors to respective memories, namely amemory 732 and a memory 734, which may be portions of main memorylocally attached to the respective processors.

Processors 770, 780 may each exchange information with a chipset 790 viaindividual P-P interfaces 752, 754 using point to point interfacecircuits 776, 794, 786, 798. Chipset 790 may also exchange informationwith a high-performance graphics circuit 738 via a high-performancegraphics interface 739.

A shared cache (not shown) may be included in either processor oroutside of both processors, yet connected with the processors via P-Pinterconnect, such that either or both processors' local cacheinformation may be stored in the shared cache if a processor is placedinto a low power mode.

Chipset 790 may be coupled to a first bus 716 via an interface 796. Inone embodiment, first bus 716 may be a Peripheral Component Interconnect(PCI) bus, or a bus such as a PCI Express bus or another thirdgeneration I/O interconnect bus, although the scope of the presentinvention is not so limited.

As shown in FIG. 7, various I/O devices 714 may be coupled to first bus716, along with a bus bridge 718 which couples first bus 716 to a secondbus 720. In one embodiment, second bus 720 may be a low pin count (LPC)bus. Various devices may be coupled to second bus 720 including, forexample, a keyboard and/or mouse 722, communication devices 727 and astorage unit 728 such as a disk drive or other mass storage device whichmay include instructions/code and data 730, in one embodiment. Further,an audio I/O 724 may be coupled to second bus 720. Note that otherarchitectures are possible. For example, instead of the point-to-pointarchitecture of FIG. 7, a system may implement a multi-drop bus or othersuch architecture.

Referring now to FIG. 8, shown is a block diagram of a third system 800in accordance with an embodiment of the present invention Like elementsin FIG. 7 and FIG. 8 bear like reference numerals, and certain aspectsof FIG. 7 have been omitted from FIG. 8 in order to avoid obscuringother aspects of FIG. 8.

FIG. 8 illustrates that the processors 870, 880 may include integratedmemory and I/O control logic (“CL”) 872 and 882, respectively. For atleast one embodiment, the CL 872, 882 may include integrated memorycontroller units such as that described above in connection with FIGS. 5and 7. In addition. CL 872, 882 may also include I/O control logic. FIG.8 illustrates that not only are the memories 832, 834 coupled to the CL872, 882, but also that I/O devices 814 are also coupled to the controllogic 872, 882. Legacy I/O devices 815 are coupled to the chipset 890.

Referring now to FIG. 9, shown is a block diagram of a SoC 900 inaccordance with an embodiment of the present invention. Similar elementsin FIG. 5 bear like reference numerals. Also, dashed lined boxes areoptional features on more advanced SoCs. In FIG. 9, an interconnectunit(s) 902 is coupled to: an application processor 910 which includes aset of one or more cores 502A-N and shared cache unit(s) 506; a systemagent unit 510; a bus controller unit(s) 516; an integrated memorycontroller unit(s) 514; a set of one or more media processors 920 whichmay include integrated graphics logic 508, an image processor 924 forproviding still and/or video camera functionality, an audio processor926 for providing hardware audio acceleration, and a video processor 928for providing video encode/decode acceleration; an static random accessmemory (SRAM) unit 930; a direct memory access (DMA) unit 932; and adisplay unit 940 for coupling to one or more external displays.

FIG. 10 illustrates a processor containing a central processing unit(CPU) and a graphics processing unit (GPU), which may perform at leastone instruction according to one embodiment. In one embodiment, aninstruction to perform operations according to at least one embodimentcould be performed by the CPU. In another embodiment, the instructioncould be performed by the GPU. In still another embodiment, theinstruction may be performed through a combination of operationsperformed by the GPU and the CPU. For example, in one embodiment, aninstruction in accordance with one embodiment may be received anddecoded for execution on the GPU. However, one or more operations withinthe decoded instruction may be performed by a CPU and the resultreturned to the GPU for final retirement of the instruction. Conversely,in some embodiments, the CPU may act as the primary processor and theGPU as the co-processor.

In some embodiments, instructions that benefit from highly parallel,throughput processors may be performed by the GPU, while instructionsthat benefit from the performance of processors that benefit from deeplypipelined architectures may be performed by the CPU. For example,graphics, scientific applications, financial applications and otherparallel workloads may benefit from the performance of the GPU and beexecuted accordingly, whereas more sequential applications, such asoperating system kernel or application code may be better suited for theCPU.

In FIG. 10, processor 1000 includes a CPU 1005, GPU 1010, imageprocessor 1015, video processor 1020, USB controller 1025, UARTcontroller 1030, SPI/SDIO controller 1035, display device 1040,High-Definition Multimedia Interface (HDMI) controller 1045, MIPIcontroller 1050, flash memory controller 1055, dual data rate (DDR)controller 1060, security engine 1065, and I²S/I²C (Integrated InterchipSound/Inter-Integrated Circuit) interface 1070. Other logic and circuitsmay be included in the processor of FIG. 10, including more CPUs or GPUsand other peripheral interface controllers.

One or more aspects of at least one embodiment may be implemented byrepresentative data stored on a machine-readable medium which representsvarious logic within the processor, which when read by a machine causesthe machine to fabricate logic to perform the techniques describedherein. Such representations, known as “IP cores” may be stored on atangible, machine readable medium (“tape”) and supplied to variouscustomers or manufacturing facilities to load into the fabricationmachines that actually make the logic or processor. For example, IPcores, such as the Cortex™ family of processors developed by ARMHoldings, Ltd. and Loongson IP cores developed the Institute ofComputing Technology (ICT) of the Chinese Academy of Sciences may belicensed or sold to various customers or licensees, such as TexasInstruments, Qualcomm, Apple, or Samsung and implemented in processorsproduced by these customers or licensees.

FIG. 11 shows a block diagram illustrating the development of IP coresaccording to one embodiment. Storage 1130 includes simulation software1120 and/or hardware or software model 1110. In one embodiment, the datarepresenting the IP core design can be provided to the storage 1130 viamemory 1140 (e.g., hard disk), wired connection (e.g., internet) 1150 orwireless connection 1160. The IP core information generated by thesimulation tool and model can then be transmitted to a fabricationfacility where it can be fabricated by a third party to perform at leastone instruction in accordance with at least one embodiment.

In some embodiments, one or more instructions may correspond to a firsttype or architecture (e.g., x86) and be translated or emulated on aprocessor of a different type or architecture (e.g., ARM). Aninstruction, according to one embodiment, may therefore be performed onany processor or processor type, including ARM, x86, MIPS, a GPU, orother processor type or architecture.

FIG. 12 illustrates how an instruction of a first type is emulated by aprocessor of a different type, according to one embodiment. In FIG. 12,program 1205 contains some instructions that may perform the same orsubstantially the same function as an instruction according to oneembodiment. However the instructions of program 1205 may be of a typeand/or format that is different or incompatible with processor 1215,meaning the instructions of the type in program 1205 may not be able tobe executed natively by the processor 1215. However, with the help ofemulation logic, 1210, the instructions of program 1205 are translatedinto instructions that are natively capable of being executed by theprocessor 1215. In one embodiment, the emulation logic is embodied inhardware. In another embodiment, the emulation logic is embodied in atangible, machine-readable medium containing software to translateinstructions of the type in the program 1205 into the type nativelyexecutable by the processor 1215. In other embodiments, emulation logicis a combination of fixed-function or programmable hardware and aprogram stored on a tangible, machine-readable medium. In oneembodiment, the processor contains the emulation logic, whereas in otherembodiments, the emulation logic exists outside of the processor and isprovided by a third party. In one embodiment, the processor is capableof loading the emulation logic embodied in a tangible, machine-readablemedium containing software by executing microcode or firmware containedin or associated with the processor.

FIG. 13 is a block diagram contrasting the use of a software instructionconverter to convert binary instructions in a source instruction set tobinary instructions in a target instruction set according to embodimentsof the invention. In the illustrated embodiment, the instructionconverter is a software instruction converter, although alternativelythe instruction converter may be implemented in software, firmware,hardware, or various combinations thereof. FIG. 13 shows a program in ahigh level language 1302 may be compiled using an x86 compiler 1304 togenerate x86 binary code 1306 that may be natively executed by aprocessor with at least one x86 instruction set core 1316. The processorwith at least one x86 instruction set core 1316 represents any processorthat can perform substantially the same functions as a Intel processorwith at least one x86 instruction set core by compatibly executing orotherwise processing (1) a substantial portion of the instruction set ofthe Intel x86 instruction set core or (2) object code versions ofapplications or other software targeted to run on an Intel processorwith at least one x86 instruction set core, in order to achievesubstantially the same result as an Intel processor with at least onex86 instruction set core. The x86 compiler 1304 represents a compilerthat is operable to generate x86 binary code 1306 (e.g., object code)that can, with or without additional linkage processing, be executed onthe processor with at least one x86 instruction set core 1316.Similarly, FIG. 13 shows the program in the high level language 1302 maybe compiled using an alternative instruction set compiler 1308 togenerate alternative instruction set binary code 1310 that may benatively executed by a processor without at least one x86 instructionset core 1314 (e.g., a processor with cores that execute the MIPSinstruction set of MIPS Technologies of Sunnyvale, Calif. and/or thatexecute the ARM instruction set of ARM Holdings of Sunnyvale, Calif.).The instruction converter 1312 is used to convert the x86 binary code1306 into code that may be natively executed by the processor without anx86 instruction set core 1314. This converted code is not likely to bethe same as the alternative instruction set binary code 1310 because aninstruction converter capable of this is difficult to make; however, theconverted code will accomplish the general operation and be made up ofinstructions from the alternative instruction set. Thus, the instructionconverter 1312 represents software, firmware, hardware, or a combinationthereof that, through emulation, simulation or any other process, allowsa processor or other electronic device that does not have an x86instruction set processor or core to execute the x86 binary code 1306.

FIG. 14A illustrates a diagram for one embodiment of an apparatus 1401for execution of an instruction to provide SIMD SM3 cryptographichashing functionality. Embodiments of apparatus 1401 may be part of apipeline 400 (e.g. execution stage 416) or part of a core 490 (e.g.execution unit(s) 462) for execution of an instruction to provide SIMDSM3 cryptographic hashing functionality. Embodiments of apparatus 1401may be coupled with a decode stage (e.g. decode 406) or a decoder (e.g.decode unit 440) to decode an instruction for a SIMD SM3 cryptographichashing algorithm round slice having a number of iterations less thatthe total number of round iterations of the hash algorithm (e.g. two orfour iterations, which may permit concurrent execution of otherinstructions in a superscalar execution pipeline) the instructionspecifying an intermediate hash value input operand 1410, a source dataoperand 1415 set, and a round-slice portion of the hashing algorithm(e.g. as an initial round, j, and/or a number of iterations, i, in anoptional immediate operand 1418, or in an instruction mnemonic and/oroperation code). Embodiments of the instruction may also specify a roundconstant operand set (e.g. T_(j) . . . T_(j+i−1) for an initial round,j, and a number of iterations, i, in an optional immediate operand1418). One or more execution units (e.g. execution apparatus 1405)responsive to the decoded instruction, perform an SM3 hashing roundslice set of round iterations upon the source data operand set 1415,applying the intermediate hash value input operand 1410 and the roundconstant operand set, and store a result 1480 of the first instructionin a SIMD destination register.

It will be appreciated that providing SIMD SM3 cryptographic hashinginstructions, which perform a pre-specified number of iterations of thehashing round, may enable SIMD execution of the hashing algorithm in aprocessor pipeline concurrently with other SIMD processing and scalarprocessing, such as preprocessing of message “chunks” and preparingpre-rotated round constants (e.g. T_(j)<<<j) according to the specifichashing algorithm implementation. That is to say that, where a singleiteration of a hashing round may have a pipeline latency of three cycles(e.g. 3 cycles per round), by performing a specified number ofiterations and/or bypassing results back through the pipeline, twoiterations may have a latency of only four cycles (e.g. 2 cycles perround), four iterations may have a latency of only six cycles (e.g. 1.5cycles per round). During those pipeline latencies of four or sixcycles, other useful processing may be performed in parallel orconcurrently with the hashing round slice. Thus providing an instructionfor a SIMD SM3 cryptographic hashing algorithm round slice, which has anumber of iterations (e.g. two, four or eight iterations, etc., perslice) but less that the total number of round iterations of the hashalgorithm, permits concurrent execution of other instructions in asuperscalar execution pipeline, and/or an out-of-order processorpipeline, thereby significantly improving processing throughput, andleveraging the scaling of frequencies for fabrication processimprovements associated with general purpose processors with vectorregisters.

For example, embodiments of apparatus 1401 may be coupled with vectorregisters (e.g. physical register files unit(s) 458) comprising avariable plurality of m variable sized data fields to store values of avariable plurality of m variable sized data elements. Embodiments of theinstruction to provide SIMD SM3 cryptographic hashing algorithm roundslice specify an intermediate hash value input state operand 1410specifying one of the vector registers, an immediate operand 1418, and asource data operand 1415 set. Embodiments of apparatus 1401 may includean execution unit 1405 coupled with the register file (e.g. physicalregister files unit(s) 458), and responsive to the decoded instructionto provide SIMD SM3 cryptographic hashing algorithm round slicefunctionality, to receive the intermediate hash value input stateoperand 1410 and the message source data operand 1415 set, and togenerate an output state 1480 for each iteration of the plurality ofiterations. The result 1480 of the decoded instruction may then bestored in a SIMD destination register (e.g. in physical register filesunit(s) 458).

FIG. 14B illustrates a diagram for an alternative embodiment of anapparatus 1402 for execution of an instruction to provide SIMD SM3cryptographic hashing functionality. Embodiments of apparatus 1402 maybe part of a pipeline 400 (e.g. execution stage 416) or part of a core490 (e.g. execution unit(s) 462) for execution of an instruction toprovide SIMD SM3 cryptographic hashing functionality. Embodiments ofapparatus 1402 may be coupled with a decode stage (e.g. decode 406) or adecoder (e.g. decode unit 440) to decode an instruction for a SIMD SM3cryptographic hashing algorithm round slice having a number ofiterations less that the total number of round iterations of the hashalgorithm (e.g. two or four iterations, which may permit concurrentexecution of other instructions in a superscalar execution pipeline) theinstruction specifying an intermediate hash value input operand 1410, asource data operand 1415 set, a round constant operand 1412 set (e.g. asingle pre-rotated T_(j) for the initial round, or optionally a set offour pre-rotated T_(j) . . . T_(j+3)), and a round-slice portion of thehashing algorithm (e.g. as an initial round, j, and/or a number ofiterations, i, in an immediate operand 1418). One or more executionunits (e.g. execution apparatus 1405) responsive to the decodedinstruction, perform an SM3 hashing round slice set of round iterationsupon the source data operand 1415 set, applying the intermediate hashvalue input operand 1410 and the round constant operand 1412 set, andstore a result 1480 of the first instruction in a SIMD destinationregister (e.g. in some embodiments the same SIMD register used forintermediate hash value input operand 1410).

FIG. 15 illustrates a diagram for another alternative embodiment of anapparatus 1501 for execution of an instruction to provide SIMD SM3cryptographic hashing functionality. Embodiments of apparatus 1501 maybe coupled with a decode stage (e.g. decode 406) or a decoder (e.g.decode unit 440) to decode an instruction for a SIMD SM3 cryptographichashing algorithm round slice having a number of iterations (e.g. two orfour iterations, although just one iteration is illustrated) which maypermit concurrent execution of other instructions in a superscalarexecution pipeline, the instruction specifying an intermediate hashvalue input operand 1510, a source data operand set (e.g. includingmessage words W_(j) and W_(j+4)), a round constant operand set (e.g.including a pre-rotated TA and a round-slice portion of the hashingalgorithm (e.g. including an indicator of an initial round, j, and/or anumber of iterations, i, optionally in an immediate operand). One ormore execution units (e.g. including execution apparatus 1501)responsive to the decoded instruction, perform an SM3 hashing roundslice set of round iterations upon the source data operand set (e.g.including 1514 and 1516), applying the intermediate hash value inputoperand 1510 and one or more of the round constant 1512 operand set, andstore a result 1580 of the decoded instruction in a SIMD destinationregister (e.g. in some embodiments the same SIMD register used forintermediate hash value input operand 1510).

As illustrated in execution apparatus 1501, Boolean functions FF_(j)1522 and GG_(j) 1524 may be selected according to the specifiedround-slice portion of the hashing algorithm (e.g. including anindicator of an initial round, j) for processing the intermediate hashvalue 32-bit data field inputs A, B, C and E, F, G respectively.According to one embodiment the Boolean functions FF_(j) and GG_(j) maybe selected as A ⊕ B ⊕ C and E ⊕ F ⊕ G respectively, when j is less than16, or as (A

B) {hacek over ( )} (A

C) {hacek over ( )} (B̂C) and (ÊF) {hacek over ( )} (

ÊG) respectively, when j is greater than 15. In each iteration of theSM3 hash-round-slice, a respective round constant 1512, T_(j), of theround constant operand set is added (e.g. via adder 1530) with aleft-rotated respective data field, A, (e.g. via rotator 1526 by arotation amount 1525) of the intermediate hash value vector 1520 and asecond unrotated data field, E, of the intermediate hash value vector1520. In each iteration of the SM3 hash-round-slice, a respective datafield 1514, W_(j), of the source data operand set is added (e.g. viaadder 1540) with the output of Boolean function GG_(j) 1524, arespective data field, H, of the intermediate hash value vector 1520,and a left-rotated output, SS1, (e.g. via rotator 1532 by a rotationamount 1531) of adder 1530. In each iteration of the SM3hash-round-slice, the respective data fields 1514, W_(j), and 1516,W_(j+4), of the source data operand set are XORed to produce therespective data field 1534, W′_(j), and the left-rotated respective datafield, A, is XORed with the left-rotated output, SS1, of adder 1530 toproduce the respective data field, SS2. Both respective data fields1534, W′_(j), and SS2 are added (e.g. via adder 1550) with the output ofBoolean function FF_(j) 1522 and with a respective data field, D, of theintermediate hash value vector 1520 to produce the new respective datafield, A, in preliminary output state 1570. The unrotated respectivedata field, A, of the intermediate hash value vector 1520 becomes thenew respective data field, B, of preliminary output state 1570. The leftrotated respective data field, B, (e.g. via rotator 1562 by a rotationamount 1561) of the intermediate hash value vector 1520 becomes the newrespective data field, C, of preliminary output state 1570. Theunrotated respective data field, C, of the intermediate hash valuevector 1520 becomes the new respective data field, D, of preliminaryoutput state 1570. The output of adder 1540 is permuted via permutation1542, P₀, to produce the new respective data field, E, of preliminaryoutput state 1570. The unrotated respective data field, E, of theintermediate hash value vector 1520 becomes the new respective datafield, F, of preliminary output state 1570. The left rotated respectivedata field, F, (e.g. via rotator 1566 by a rotation amount 1565) of theintermediate hash value vector 1520 becomes the new respective datafield, G, of preliminary output state 1570. The unrotated respectivedata field, G, of the intermediate hash value vector 1520 becomes thenew respective data field, H, of preliminary output state 1570.

Finally, in each iteration of the SM3 hash-round-slice, the preliminaryoutput state 1570 is stored as a new output state 1580, V_(j+1). In someembodiments an output state latch stores an output state 1580 (e.g. thenew V_(j+1) values) generated as a result of an iteration. Bypassing thehash value output state 1580 to the intermediate hash value input statemay be performed in some embodiments by a bypass (e.g. bypass network208 or 210) from the output state 1580 latch to bypass the output state1580 to the input state 1520 for each next iteration of the plurality ofiterations of the SM3 hash-round-slice. Further details of the Booleanfunctions, permutations, round constant parameters, and messageexpansion, etc. may be found in “SM3 Hash Function,” IETFInternet-Draft, Chinese Academy of Science, 14 Feb. 2014, version 01,available on the world-wide-web attools.ietf.org/pdf/draft-shen-sm3-hash-01.pdf.

FIG. 16 illustrates a diagram for another alternative embodiment of anapparatus 1601 for execution of an instruction to provide SIMD SM3cryptographic hashing functionality. Embodiments of apparatus 1601 maybe part of a pipeline 400 (e.g. execution stage 416) or part of a core490 (e.g. execution unit(s) 462) for execution of an instruction toprovide SIMD SM3 cryptographic hashing functionality. Embodiments ofapparatus 1601 may be coupled with a decode stage (e.g. decode 406) or adecoder (e.g. decode unit 440) to decode an instruction for a SIMD SM3cryptographic hashing algorithm round slice having a number ofiterations less that the total number of round iterations of the hashalgorithm (e.g. four iterations, which may permit concurrent executionof other instructions in a superscalar execution pipeline) theinstruction specifying an intermediate hash value input operand 1610, asource data operand 1615 set, an optional round constant operand 1612set (e.g. including either a single initial pre-rotated T_(j) oroptionally a set of four pre-rotated T_(j) . . . T_(j+3)), and around-slice portion of the hashing algorithm (e.g. optionally as aninitial round, j, and/or a number of iterations, i, in an immediateoperand 1418). Some embodiments of the instruction for a SIMD SM3cryptographic hashing algorithm round slice may specify a single initialpre-rotated constant T_(j) and internally rotate that single initialconstant one bit in each round of the slice. Other alternativeembodiments of the instruction for a SIMD SM3 cryptographic hashingalgorithm round slice may specify only a value for j (e.g. in animmediate operand 1618) and look up or generate each rotated constant,T_(j)<<<j, internally. Still other alternative embodiments of theinstruction for a SIMD SM3 cryptographic hashing algorithm round slicemay specify a plurality of pre-rotated constants as a set (e.g. of fourpre-rotated T_(j) . . . T_(j+3)). One or more execution units (e.g.execution apparatus 1601) responsive to the decoded instruction, performan SM3 hashing round slice set of round iterations upon the source dataoperand 1615 set (e.g. the respective data fields W_(j), and W_(j+4))applying the intermediate hash value input operand 1610 and one or moreof the round constant operand 1612 set (e.g. T_(j)) in SM3 round_(j)1605 to produce preliminary output state 1681, V_(j+1). Furtherresponsive to the decoded instruction, a second SM3 hashing rounditeration is performed upon the source data operand 1615 set (e.g. therespective data fields W_(j+1), and W_(j+5)) applying the secondintermediate hash value input 1681, V_(j+1) and one or more of the roundconstant operand 1612 set (e.g. T_(j+1)) in SM3 round_(j+1) 1606 toproduce preliminary output state 1682, V_(j+2); . . . and a fourth SM3hashing round iteration is performed upon the source data operand 1615set (e.g. the respective data fields W_(j+3), and W_(j+7)) applying thefourth intermediate hash value input, V_(j+3), (not shown) and one ormore of the round constant operand 1612 set (e.g. T_(j+3)) in SM3round_(j+3) 1608 to produce as a result of the instruction a new outputstate 1684, V_(j+4), and store the result 1684 of the instruction in aSIMD destination register (e.g. in some embodiments the same SIMDregister used for intermediate hash value input operand 1610).

Some embodiments may also include a processor comprising a decoder todecode instructions for a SIMD SM3 message expansion, specifying firstand second source data operand sets, and an expansion extent. Processorexecution units, responsive to the instruction, perform a number of SM3message expansions, from the first and second source data operand sets,determined by the specified expansion extent and store the result into aSIMD destination register. For some embodiments of SIMD instructions andprocessing logic to provide SM3 cryptographic hashing functionality,both SM3 message expansion and SM3 cryptographic hash rounds may beperformed in slices of iterations concurrently and/or in parallel in astandard execution pipeline of a modern microprocessor. It will beappreciated that the number of iterations per slice may be convenientlychosen so as to provide a sufficient cover for other concurrentin-flight instructions by the latencies associated with performing aslice of SM3 message expansions and/or a slice of SM3 cryptographic hashrounds.

FIG. 17A illustrates a diagram for one embodiment of an apparatus 1701for execution of another instruction to provide SIMD SM3 cryptographichashing functionality. Embodiments of apparatus 1701 may be part of apipeline 400 (e.g. execution stage 416) or part of a core 490 (e.g.execution unit(s) 462) for execution of an instruction to provide SIMDSM3 cryptographic hashing functionality. Embodiments of apparatus 1701may be coupled with a decode stage (e.g. decode 406) or a decoder (e.g.decode unit 440) to decode an instruction for a SIMD SM3 cryptographichashing algorithm message expansions having a number of iterations lessthat the total number of message expansion iterations (e.g. less thanfifty-two message expansion iterations) of the hash algorithm (e.g. twoor four iterations, which may permit concurrent execution of otherinstructions in a superscalar execution pipeline) the instructionspecifying a first source data operand 1719 set (e.g. W_(j−16),W_(j−15), . . . W_(j−9)) and a second source data operand 1711 set (e.g.W_(j−8), W_(j−7), . . . W_(j−1)), and an expansion extent (e.g.optionally as an expansion extent number of iterations, e, in animmediate operand 1718, or in an instruction mnemonic and/or operationcode). One or more execution units (e.g. execution apparatus 1704)responsive to the decoded instruction, perform an SM3 hashing algorithmslice set of message expansion iterations upon the first source dataoperand 1719 set and the second source data operand 1711 set, the numberof SM3 message expansions being determined by the specified expansionextent, and store a result 1790 (e.g. W_(j−4), . . . W_(j−1), W_(j), . .. W_(j+3)) of the instruction in a SIMD destination register.

FIG. 17B illustrates a diagram for an alternative embodiment of anapparatus 1702 for execution of another instruction to provide SIMD SM3cryptographic hashing functionality. Embodiments of apparatus 1702 maybe part of a pipeline 400 (e.g. execution stage 416) or part of a core490 (e.g. execution unit(s) 462) for execution of an instruction toprovide SIMD SM3 cryptographic hashing functionality. Embodiments ofapparatus 1702 may be coupled with a decode stage (e.g. decode 406) or adecoder (e.g. decode unit 440) to decode an instruction for a SIMD SM3cryptographic hashing algorithm message expansions having a number ofiterations less that the total number of message expansion iterations(e.g. less than fifty-two message expansion iterations) of the hashalgorithm (e.g. two or four iterations, which may permit concurrentexecution of other instructions in a superscalar execution pipeline) theinstruction specifying a first source data operand 1719 set (e.g.W_(j−16), W_(j−15), . . . W_(j−9)) and a second source data operand 1711set (e.g. W_(j−8), W_(j−7), . . . W_(j−1)), and an expansion extent(e.g. optionally as an expansion extent number of iterations, e+1, in animmediate operand 1718, or in an instruction mnemonic and/or operationcode). One or more execution units (e.g. execution apparatus 1703)responsive to the decoded instruction, perform an SM3 hashing algorithmslice set of message expansion iterations upon the first source dataoperand 1719 set and the second source data operand 1711 set, the numberof SM3 message expansions being determined by the specified expansionextent, and store a result 1792 (e.g. W_(j+e−7), . . . W_(j−1), W_(j), .. . W_(j+e)) of the instruction in a SIMD destination register (e.g. insome embodiments the same SIMD register used for the first source dataoperand 1719 or for the second source data operand 1711).

FIG. 18A illustrates a diagram for another alternative embodiment of anapparatus 1801 for execution of another instruction to provide SIMD SM3cryptographic hashing functionality. Embodiments of apparatus 1801 maybe part of a pipeline 400 (e.g. execution stage 416) or part of a core490 (e.g. execution unit(s) 462) for execution of an instruction toprovide SIMD SM3 cryptographic hashing functionality. Embodiments ofapparatus 1801 may be coupled with a decode stage (e.g. decode 406) or adecoder (e.g. decode unit 440) to decode an instruction for a SIMD SM3cryptographic hashing algorithm message expansions having a number ofiterations less that the total number of message expansion iterations(e.g. less than fifty-two message expansion iterations) of the hashalgorithm (e.g. two or four iterations, which may permit concurrentexecution of other instructions in a superscalar execution pipeline) theinstruction specifying a first source data operand 1819 set (e.g. W₀,W₁, . . . W₇) and a second source data operand 1811 set (e.g. W₈, W₉, .. . W₁₅), and an expansion extent (e.g. optionally as an expansionextent number of iterations, or iterations minus one, e, in an immediateoperand not shown, or in an instruction mnemonic and/or operation code).One or more execution units (e.g. execution apparatus 1808) responsiveto the decoded instruction, perform an SM3 hashing algorithm slice setof message expansion iterations upon the first source data operand 1819set and the second source data operand 1811 set, the number of SM3message expansions being determined by the specified expansion extent.For example, in one embodiment a newly expanded (or extended) messageword, W₁₆, is produced as an element of a result 1890 of the instructionas follows: W₁₆=P₁(W₀ ⊕ W₇ ⊕ (W₁₃<<<15)) ⊕ (W₃<<<7) ⊕ W₁₀, at 1804wherein permutation 1803, P₁, is defined as P₁(X)=X ⊕ (X<<<15) ⊕(X<<<23). A newly expanded (or extended) message word, W₁₇, is producedas an element of result 1890 of the instruction as follows: W₁₇=P₁(W₁ ⊕W₈ ⊕ (W₁₄<<<15)) ⊕ (W₄<<<7) ⊕ W₁₁, at 1805. A newly expanded (orextended) message word, W₁₈, is produced as an element of result 1890 ofthe instruction as: W₁₈=P₁(W₂ ⊕ W₉ ⊕ (W₁₅<<<15)) ⊕ (W₅<<<7) ⊕ W₁₂, at1806. A message expansion for one of the four new 32-bit words, W₁₉,requires one other of the four new 32-bit words (i.e. W₁₆) in additionto 32-bit word data elements of the first (i.e. 1819) and second (i.e.1811) source data operand sets. Accordingly, the permutation P₁(W₃ ⊕ W₁₀⊕ (W₁₆<<<15)), in one embodiment, may be produced as shown in processingblock 1802 as P₁(W₃) ⊕ P₁(W₁₀) ⊕ P₁(W₁₆<<<15) and XORed with (W₆<<<7)and with W₁₃ to produce, at 1807, a newly expanded (or extended) messageword, W₁₉, as an element of result 1890 of the instruction. The result1890 (e.g. W₁₂, . . . W₁₅, W₁₆, . . . W₁₉) of the instruction may thenbe stored in a SIMD destination register. In some embodiments an outputlatch stores the result 1890 generated as an intermediate result of aniteration. Bypassing the intermediate result 1890 to one or more inputsource data operand of another micro-instruction (or micro-operation, oruop) may be performed in some embodiments by a bypass (e.g. bypassnetwork 208 or 210).

FIG. 18B illustrates a diagram for yet another alternative embodiment ofan apparatus 1810 for execution of another instruction to provide SIMDSM3 cryptographic hashing functionality. Embodiments of apparatus 1810may be part of a pipeline 400 (e.g. execution stage 416) or part of acore 490 (e.g. execution unit(s) 462) for execution of an instruction toprovide SIMD SM3 cryptographic hashing functionality. Embodiments ofapparatus 1810 may be coupled with a decode stage (e.g. decode 406) or adecoder (e.g. decode unit 440) to decode an instruction for a SIMD SM3cryptographic hashing algorithm message expansions having a number ofiterations less that the total number of message expansion iterations(e.g. less than fifty-two message expansion iterations) of the hashalgorithm (e.g. eight iterations, which may permit concurrent executionof other instructions in a superscalar execution pipeline) theinstruction specifying a first source data operand 1819 set (e.g. W₀,W₁, . . . W₇) and a second source data operand 1811 set (e.g. W₈, W₉, .. . W₁₅), and an expansion extent (e.g. optionally as an expansionextent number of iterations, or iterations minus one, e, in an immediateoperand 1818, or in an instruction mnemonic and/or operation code). Oneor more execution units (e.g. execution apparatus 1809) responsive tothe decoded instruction, perform an SM3 hashing algorithm slice set ofmessage expansion iterations upon the first source data operand 1819 setand the second source data operand 1811 set, the number of SM3 messageexpansions being determined by the specified expansion extent. In oneembodiment an intermediate result 1821 (e.g. W₁₂, . . . W₁₅, W₁₆, . . .W₁₉) may be produced by one or more execution units (e.g. executionapparatus 1808) responsive to the decoded instruction (e.g. as a resultof a micro-instruction, micro-operation or uop). The intermediate result1821 may then be provided to a subsequent logic layer (e.g. executionapparatus 1808) along with elements of the first source data operand1819 set (e.g. W₄, W₅, . . . W₇) and the second source data operand 1811set (e.g. W₈, W₉, . . . W₁₁) to produce an expanded (or extended)message result 1890 (e.g. W₁₆, . . . W₁₉, W₂₀, . . . W₂₃) responsive tothe decoded instruction (e.g. as a result of a second micro-instruction,micro-operation or uop). The result 1890 (e.g. W₁₆, . . . W₁₉, W₂₀, . .. W₂₃) of the instruction may then be stored in a SIMD destinationregister (e.g. in some embodiments the same SIMD register used for thefirst source data operand 1719).

FIG. 19 illustrates a flow diagram for an embodiment of a process 1901for execution of an instruction to provide SIMD SM3 cryptographichashing functionality. Process 1901 and other processes herein disclosedare performed by processing blocks that may comprise dedicated hardwareor software or firmware operation codes executable by general purposemachines or by special purpose machines or by a combination of both.

In processing block 1910 of process 1901 an intermediate hash valueinput state source operand of an SM3 hash algorithm is stored (e.g. in afirst portion of a plurality of m data fields) in a first SIMD vectorregister. In processing block 1920 a source data operand set is stored(e.g. in a second portion of the plurality of m data fields) in a secondSIMD vector register. In processing block 1925 an instruction isreceived for a SIMD SM3 hash round slice portion of an SM3 hashingalgorithm. In processing block 1950 a hash value output state isgenerated as the result of an iteration of the SIMD SM3 hash roundslice. In processing block 1960 a determination is made as to whether ornot all iterations of the hash round slice have finished. If not, theoutput state result is optionally bypassed in processing block 1970 tothe input state for a next iteration of the hash round slice andprocessing reiterates beginning in processing block 1950. Otherwiseprocessing proceeds to processing block 1980 where the hash value outputstate result is stored to a destination operand in the first SIMDregister.

It will be appreciated that while the processing blocks of process 1901and other processes herein disclosed are illustrated as being executedin an iterative fashion, execution in alternative orders, orconcurrently, or in parallel may preferably be performed wheneverpossible.

FIG. 20 illustrates a flow diagram for another embodiment of a process2001 for execution of an instruction to provide SIMD SM3 cryptographichashing functionality. In processing block 2010 of process 2001 anintermediate hash value input state source operand of an SM3 hashalgorithm is stored (e.g. in a first portion of a plurality of m datafields) in a first SIMD vector register. In processing block 2015 amessage block is extended for a round-slice source data operand set. Inprocessing block 2020 a source data operand set is stored (e.g. in asecond portion of the plurality of m data fields) in a second SIMDvector register or in memory. In processing block 2025 an instruction isdecoded for a SIMD SM3 hash round slice portion of an SM3 hashingalgorithm, the instruction specifying said round slice portion in animmediate operand. In processing block 2030 a pair of round slice sourcedata (e.g. W_(j), and W_(j+4)) are selected from the second SIMDregister or from memory for the current iteration. In processing block2035 a round constant (e.g. T_(j)) is selected for the current roundslice portion iteration. In processing block 2040 a pair of Booleanfunctions (e.g. FF_(j), and GG_(j)) are selected for the currentiteration. In processing block 2045 an SM3 hash round is performed onthe selected source data and the intermediate hash value input state. Inprocessing block 2050 a hash value output state is generated as theresult of an iteration of the SIMD SM3 hash round slice. In processingblock 2060 a determination is made as to whether or not all iterationsof the hash round slice have finished. If not, the output state resultis optionally bypassed in processing block 2070 to the input state for anext iteration of the hash round slice and processing reiteratesbeginning in processing block 2030. Otherwise processing proceeds toprocessing block 2080 where the hash value output state result is storedto a destination operand in the first SIMD register. In some alternativeembodiments, the hash value output state result may be stored to adestination operand in a SIMD register other than the first SIMDregister, or in memory.

FIG. 21 illustrates a flow diagram for an embodiment of a process 2101for execution of an alternative instruction to provide SIMD SM3cryptographic hashing functionality. In processing block 2110 of process2101 a first source data operand set of an SM3 hash algorithm is stored(e.g. in a first portion of a plurality of m data fields) in a firstSIMD vector register. In processing block 2120 a second source dataoperand set is stored (e.g. in a second portion of the plurality of mdata fields) in a second SIMD vector register. In processing block 2130an instruction is received for a SIMD SM3 message expansion (orextension) slice of an SM3 hashing algorithm. In processing block 2140 anew message word is generated as the result of an iteration of the SIMDSM3 message expansion slice. In processing block 2150 a determination ismade as to whether or not all iterations of the message expansion slicehave finished. If not, the extended message block result is optionallybypassed in processing block 2160 to the input state for a nextiteration of the message expansion slice and processing reiteratesbeginning in processing block 2140. Otherwise processing proceeds toprocessing block 2170 where the extended message block result is storedto a destination operand in the first SIMD register. In some alternativeembodiments, the extended message block result may be stored to adestination operand in a SIMD register other than the first SIMDregister, or in memory.

It will be appreciated that SIMD SM3 cryptographic hashing instructions,as disclosed herein, may be used to provide SIMD SM3 cryptographichashing functionality in applications, such as cryptographic protocolsand Internet communication to assure data integrity, digital signatures,identity verification, message content authentication and message originauthentication for financial transactions, electronic commerce,electronic mail, software distribution, data storage, random numbergeneration, and so on.

For some embodiments of SIMD instructions and processing logic toprovide SM3 cryptographic hashing functionality, both SM3 messageexpansion and SM3 cryptographic hash rounds may be performed in slicesof iterations concurrently and/or in parallel in a standard executionpipeline of a modern microprocessor. It will be appreciated that thenumber of iterations per slice may be conveniently chosen so as toprovide a sufficient cover for other concurrent in-flight instructionsby the latencies associated with performing a slice of SM3 messageexpansions and/or a slice of SM3 cryptographic hash rounds.

Therefore, it will also be appreciated that providing execution of aninstruction for a SIMD SM3 cryptographic hashing algorithm round slice,which has a number of iterations (e.g. two, four or eight iterations perslice) but less that the total number of round iterations of the hashalgorithm, permits concurrent execution of other instructions (e.g. SM3message expansion instructions) in a superscalar execution pipeline,and/or an out-of-order processor pipeline, thereby significantlyimproving processing throughput for a large number of applications, andleveraging the scaling of frequencies for fabrication processimprovements associated with general purpose processors.

Embodiments of the mechanisms disclosed herein may be implemented inhardware, software, firmware, or a combination of such implementationapproaches. Embodiments of the invention may be implemented as computerprograms or program code executing on programmable systems comprising atleast one processor, a storage system (including volatile andnon-volatile memory and/or storage elements), at least one input device,and at least one output device.

Program code may be applied to input instructions to perform thefunctions described herein and generate output information. The outputinformation may be applied to one or more output devices, in knownfashion. For purposes of this application, a processing system includesany system that has a processor, such as, for example; a digital signalprocessor (DSP), a microcontroller, an application specific integratedcircuit (ASIC), or a microprocessor.

The program code may be implemented in a high level procedural or objectoriented programming language to communicate with a processing system.The program code may also be implemented in assembly or machinelanguage, if desired. In fact, the mechanisms described herein are notlimited in scope to any particular programming language. In any case,the language may be a compiled or interpreted language.

One or more aspects of at least one embodiment may be implemented byrepresentative instructions stored on a machine-readable medium whichrepresents various logic within the processor, which when read by amachine causes the machine to fabricate logic to perform the techniquesdescribed herein. Such representations, known as “IP cores” may bestored on a tangible, machine readable medium and supplied to variouscustomers or manufacturing facilities to load into the fabricationmachines that actually make the logic or processor.

Such machine-readable storage media may include, without limitation,non-transitory, tangible arrangements of articles manufactured or formedby a machine or device, including storage media such as hard disks, anyother type of disk including floppy disks, optical disks, compact diskread-only memories (CD-ROMs), compact disk rewritable's (CD-RWs), andmagneto-optical disks, semiconductor devices such as read-only memories(ROMs), random access memories (RAMs) such as dynamic random accessmemories (DRAMs), static random access memories (SRAMs), erasableprogrammable read-only memories (EPROMs), flash memories, electricallyerasable programmable read-only memories (EEPROMs), magnetic or opticalcards, or any other type of media suitable for storing electronicinstructions.

Accordingly, embodiments of the invention also include non-transitory,tangible machine-readable media containing instructions or containingdesign data, such as Hardware Description Language (HDL), which definesstructures, circuits, apparatuses, processors and/or system featuresdescribed herein. Such embodiments may also be referred to as programproducts.

In some cases, an instruction converter may be used to convert aninstruction from a source instruction set to a target instruction set.For example, the instruction converter may translate (e.g., using staticbinary translation, dynamic binary translation including dynamiccompilation), morph, emulate, or otherwise convert an instruction to oneor more other instructions to be processed by the core. The instructionconverter may be implemented in software, hardware, firmware, or acombination thereof. The instruction converter may be on processor, offprocessor, or part on and part off processor.

Thus, techniques for performing one or more instructions according to atleast one embodiment are disclosed. While certain exemplary embodimentshave been described and shown in the accompanying drawings, it is to beunderstood that such embodiments are merely illustrative of and notrestrictive on the broad invention, and that this invention not belimited to the specific constructions and arrangements shown anddescribed, since various other modifications may occur to thoseordinarily skilled in the art upon studying this disclosure. In an areaof technology such as this, where growth is fast and furtheradvancements are not easily foreseen, the disclosed embodiments may bereadily modifiable in arrangement and detail as facilitated by enablingtechnological advancements without departing from the principles of thepresent disclosure or the scope of the accompanying claims.

What is claimed is:
 1. A processor comprising: a decode stage to decodea first instruction for a SIMD SM3 hash round slice, the firstinstruction specifying a round-slice portion of the hashing algorithm,an intermediate hash value input operand, a source data operand set, anda round constant operand set; and one or more execution units,responsive to the decoded first instruction, to: perform an SM3 hashinground-slice set of round iterations upon the source data operand set,applying the intermediate hash value input operand and the roundconstant operand set; and store a result of the first instruction in aSIMD destination register.
 2. The processor of claim 1, wherein thefirst instruction specifies said SIMD destination register also as theintermediate hash value input operand.
 3. The processor of claim 1,wherein the first instruction specifies said round-slice portion of thehashing algorithm by a first field in an immediate operand.
 4. Theprocessor of claim 3, wherein the first instruction specifies said roundconstant operand set at least in part by a second field in the immediateoperand.
 5. The processor of claim 4, wherein the first instructionfurther specifies a Boolean function FF_(j) and GG_(j) selector by saidsecond field in the immediate operand.
 6. The processor of claim 1,wherein the first instruction specifies said round-slice portion of thehashing algorithm in a first instruction mnemonic to be four rounds. 7.The processor of claim 6, wherein said round constant operand setcomprises four pre-rotated 32-bit constant values.
 8. The processor ofclaim 1, wherein the first instruction specifies said round-sliceportion of the hashing algorithm in a first instruction mnemonic to betwo rounds.
 9. The processor of claim 1, wherein the first instructionspecifies said round-slice portion of the hashing algorithm in a firstinstruction mnemonic to be one round.
 10. The processor of claim 1,wherein the first instruction specifies said source data operand set asa SIMD register comprising eight 32-bit values.
 11. The processor ofclaim 1, wherein the first instruction specifies said source dataoperand set as a memory location comprising eight 32-bit values.
 12. Theprocessor of claim 1, wherein the first instruction specifies saidsource data operand set as two SIMD registers each comprising four32-bit values.
 13. The processor of claim 1, wherein the firstinstruction specifies said round-slice portion of the hashing algorithmby a first field in an immediate operand to store a round number between0 and 63 and by a second field to store an iteration count between 0 and3.
 14. A processor comprising: a decode stage to decode a firstinstruction for a SIMD SM3 message expansion, the first instructionspecifying a first source data operand set, a second source data operandset, and an expansion extent; and one or more execution units,responsive to the decoded first instruction, to: perform a number of SM3message expansions from the first and second source data operand sets,the number of SM3 message expansions being determined by the specifiedexpansion extent; and store a result of the first instruction in a SIMDdestination register.
 15. The processor of claim 14, wherein the firstinstruction specifies said SIMD destination register as a destinationoperand.
 16. The processor of claim 14, wherein the first instructionspecifies said first and second source data operand sets as two SIMDregisters each comprising eight 32-bit values.
 17. The processor ofclaim 14, wherein the first instruction specifies said expansion extentby a first field in an immediate operand.
 18. The processor of claim 14,wherein the first instruction specifies said expansion extent in a firstinstruction mnemonic to indicate a message expansion of four new 32-bitwords.
 19. The processor of claim 18, wherein the message expansion forone of the four new 32-bit words requires one other of the four new32-bit words in addition to the first and second source data operandsets.
 20. The processor of claim 14, wherein the first instructionspecifies said expansion extent in a first instruction mnemonic toindicate a message expansion of two new 32-bit words.
 21. The processorof claim 14, wherein the first instruction specifies said expansionextent in a first instruction mnemonic to indicate a message expansionof one new 32-bit word.
 22. The processor of claim 14, wherein the firstinstruction specifies said expansion extent in a first instructionmnemonic to indicate a message expansion of four new 32-bit words.
 23. Amethod comprising: storing in a first portion of a plurality of m datafields of a first vector register, an intermediate hash value inputstate source operand of an SM3 hash algorithm; storing in a secondportion of the plurality of m data fields of a second vector register, asource data operand set; executing, in a processor, a SIMD instructionfor an SM3 hash-round-slice portion of the SM3 hashing algorithm havinga plurality of iterations less that a total number of round iterationsof the SM3 hash algorithm; and for each iteration of the SM3hash-round-slice, generating a result of an iteration, storing a hashvalue output state generated as the result of the iteration, andbypassing the hash value output state to the intermediate hash valueinput state for each next iteration of the plurality of iterations. 24.The method of claim 23 further comprising: storing in a third portion ofthe plurality of m data fields of a third vector register, a roundconstant operand set; and for each iteration of the SM3hash-round-slice, reading a respective round constant, T_(j), of theround constant operand set and adding the respective round constant witha left-rotated respective data field, A, of the first vector registerand a second unrotated data field, E, of the first vector register. 25.The method of claim 24 wherein said third portion comprises four of theplurality of m data fields of the third vector register, and each roundconstant, T_(j), of the stored round constant operand set is pre-rotatedleft by j bits.
 26. The method of claim 23 further comprising: for eachiteration of the SM3 hash-round-slice, reading a respective data field,W_(j), of the second vector register and XORing the respective datafield of the second vector register with a second data field, W_(j+4),of the second vector register.
 27. The method of claim 26 wherein saidsecond portion comprises eight of the plurality of m data fields of thesecond vector register.
 28. The method of claim 23 wherein said firstportion comprises eight of the plurality of m data fields of the firstvector register.
 29. The method of claim 23 wherein the SIMD instructionspecifies said round-slice portion of the SM3 hashing algorithm by afirst field in an immediate operand.
 30. The method of claim 29 whereinthe SIMD instruction specifies a round constant operand set at least inpart by a second field in the immediate operand.
 31. The method of claim30 wherein the SIMD instruction further specifies a Boolean functionFF_(j) and GG_(j) selector by said second field in the immediateoperand.
 32. A method comprising: storing in a first portion of aplurality of m data fields of a first vector register, a first sourcedata operand set; storing in a second portion of the plurality of m datafields of a second vector register, a second source data operand set;executing, in a processor, a SIMD instruction specifying an expansionextent for an SM3 message-expansion-slice portion for the SM3 hashingalgorithm having a number of SM3 message expansions from the first andsecond source data operand sets, the number of SM3 message expansionsbeing determined by the specified expansion extent; and storing a resultof the SIMD instruction in a SIMD destination register.
 33. The methodof claim 32, wherein the SIMD instruction specifies said first andsecond source data operand sets as two SIMD registers each comprisingeight 32-bit values.
 34. The method of claim 32, wherein the SIMDinstruction specifies said expansion extent by a first field in animmediate operand.
 35. The method of claim 32, wherein the SIMDinstruction specifies said expansion extent in a first instructionmnemonic to indicate a message expansion of four new 32-bit words. 36.The method of claim 35, wherein the message expansion for one of thefour new 32-bit words requires one other of the four new 32-bit words inaddition to the first and second source data operand sets.
 37. Aprocessing system comprising: a memory to store a first instruction fora SIMD SM3 hashing algorithm round slice, and a second instruction foran SM3 message expansion slice for the SM3 hashing algorithm; and aprocessor comprising: an instruction fetch stage to fetch the firstinstruction; a decode stage to decode the first instruction, the firstinstruction specifying specifying a round-slice portion of the hashingalgorithm, an intermediate hash value input operand, a round-slicesource data operand set, and a round constant operand set; the decodestage to decode the second instruction, the second instructionspecifying a first source data operand set, a second source data operandset, and an expansion extent; and one or more execution units,responsive to the decoded first instruction, to: perform an SM3 hashinground-slice set of round iterations upon the round-slice source dataoperand set, applying the intermediate hash value input operand and theround constant operand set, and storing a first result of the firstinstruction in a first SIMD destination register; and the one or moreexecution units, responsive to the decoded second instruction, to:perform a number of SM3 message expansions from the first and secondsource data operand sets, the number of SM3 message expansions beingdetermined by the specified expansion extent, and storing a secondresult of the second instruction in a second SIMD destination register.38. The processing system of claim 37, wherein the first instructionspecifies said round-slice portion of the hashing algorithm by a firstfield in an immediate operand.
 39. The processing system of claim 37,wherein the first instruction specifies said round constant operand setat least in part by a second field in the immediate operand.
 40. Theprocessing system of claim 39, wherein the first instruction furtherspecifies a Boolean function FF_(j) and GG_(j) selector by said secondfield in the immediate operand.
 41. The processing system of claim 37,wherein the first instruction specifies said round-slice portion of thehashing algorithm in a first instruction mnemonic to be four rounds. 42.The processing system of claim 41, wherein said round constant operandset comprises an initial pre-rotated 32-bit constant value.
 43. Theprocessing system of claim 42, wherein said round constant operand setcomprises four pre-rotated 32-bit constant values.
 44. The processingsystem of claim 37, wherein the second instruction specifies said firstand second source data operand sets as two SIMD registers eachcomprising eight 32-bit values.
 45. The processing system of claim 37,wherein the second instruction specifies said expansion extent by afirst field in an immediate operand.
 46. The processing system of claim37, wherein the second instruction specifies said expansion extent in afirst instruction mnemonic to indicate a message expansion of four new32-bit words.